Transmitter and shortening method thereof

ABSTRACT

A transmitter is provided. The transmitter includes: an outer encoder configured to encode input bits to generate outer-encoded bits including the input bits and parity bits; a zero padder configured to generate a plurality of bit groups each of which is formed of a same number of bits, maps the outer-encoded bits to some of the bits in the bit groups, and pads zero bits to remaining bits in the bit groups, based on a predetermined shortening pattern, thereby to constitute Low Density Parity Check (LDPC) information bits; and an LDPC encoder configured to encode the LDPC information bits, wherein the remaining bits in which zero bits are padded include some of the bit groups which are not sequentially disposed in the LDPC information bits.

CROSS-REFERENCE TO THE RELATED APPLICATIONS

This application claims priority from Korean Patent Application No.10-2015-0137184 filed on Sep. 27, 2015 and U.S. Provisional ApplicationNo. 62/127,027 filed on Mar. 2, 2015, the disclosure of which isincorporated herein in its entirety by reference.

BACKGROUND

1. Field

Apparatuses and methods consistent with the exemplary embodiments of theinventive concept relate to a transmitter and a shortening methodthereof, and more particularly, to a transmitter performing shorteningby padding zero bits and a shortening method thereof.

2. Description of the Related Art

Broadcast communication services in information oriented society of the21^(st) century are entering an era of digitalization,multi-channelization, bandwidth broadening, and high quality. Inparticular, as a high definition digital television (TV) and portablebroadcasting signal reception devices are widespread, digitalbroadcasting services have an increased demand for a support of variousreceiving schemes.

According to such demand, standard groups set up broadcastingcommunication standards to provide various signal transmission andreception services satisfying the needs of a user. Still, however, amethod for providing

SUMMARY

The exemplary embodiments of the inventive concept may overcomedisadvantages of the related art signal transmitter and receiver andmethods thereof. However, these embodiments are not required to or maynot overcome such disadvantages.

The exemplary embodiments provide a transmitter performing shorteningbased on a preset shortening pattern and a shortening method thereof.

According to an aspect of an exemplary embodiment, there is provided atransmitter which may include: an outer encoder configured to encodeinput bits to generate outer-encoded bits including the input bits andparity bits; a zero padder configured to generate a plurality of bitgroups each of which is formed of a same number of bits, maps theouter-encoded bits to some of the bits in the bit groups, and pads zerobits to remaining bits in the bit groups, based on a predeterminedshortening pattern, thereby to constitute Low Density Parity Check(LDPC) information bits; and an LDPC encoder configured to encode theLDPC information bits, wherein the remaining bits in which zero bits arepadded include some of the bit groups which are not sequentiallydisposed in the LDPC information bits.

According to an aspect of another exemplary embodiment, there isprovided a shortening method of a transmitter. The method may include:encoding input bits to generate outer-encoded bits including the inputbits and parity bits; generating a plurality of bit groups each of whichis formed of a same number of bits, mapping the outer-encoded bits tosome of the bits in the bit groups, and padding zero bits to remainingbits in the bit groups, based on a predetermined shortening pattern,thereby to constitute LDPC information bits; and encoding the LDPCinformation bits, wherein the remaining bits in which zero bits arepadded include some of the bit groups which are not sequentiallydisposed in the LDPC information bits.

As described above, according to various exemplary embodiments of theinventive concept, shortening may be performed based on a presetshortening pattern to position LDPC information bits at specificposition, thereby improving performance of a bit error rate (BER) and aframe error rate (FER).

BRIEF DESCRIPTION OF THE DRAWING FIGURES

The above and/or other aspects of the exemplary embodiments will bedescribed herein with reference to the accompanying drawings, in which:

FIG. 1 is a block diagram for describing a configuration of atransmitter, according to an exemplary embodiment;

FIG. 2 is a diagram for describing a shortening procedure, according toan exemplary embodiment;

FIGS. 3 and 4 are diagrams for describing parity check matrices,according to exemplary embodiments;

FIG. 5 is a diagram illustrating a parity check matrix having a quasicyclic structure, according to an exemplary embodiment;

FIG. 6 is a diagram for describing a frame structure, according to anexemplary embodiment;

FIGS. 7 and 8 are block diagrams for describing detailed configurationsof a transmitter, according to exemplary embodiments;

FIGS. 9 to 22 are diagrams for describing methods for processingsignaling, according to exemplary embodiments;

FIGS. 23 and 24 are block diagrams for describing configurations of areceiver, according to exemplary embodiments;

FIGS. 25 and 26 are diagrams for describing examples of combining LogLikelihood Ratio (LLR) values of a receiver, according to exemplaryembodiments;

FIG. 27 is a diagram illustrating an example of providing information ona length of L1 signaling, according to an exemplary embodiment; and

FIG. 28 is a flow chart for describing a shortening method, according toan exemplary embodiment.

DETAILED DESCRIPTION OF THE EXEMPLARY EMBODIMENTS

Hereinafter, exemplary embodiments will be described in more detail withreference to the accompanying drawings.

FIG. 1 is a block diagram for describing a configuration of atransmitter according to an exemplary embodiment.

Referring to FIG. 1, a transmitter 100 includes an outer encoder 110, azero padder 120 and a Low Density Parity Check (LDPC) encoder 130.

The outer encoder 110 encodes input bits to generate parity bits (orparity check bits).

Here, the input bits may be information bits of signaling (alternativelyreferred to as signaling bits or signaling information). For example,the information bits may include information required for a receiver 200(as illustrated in FIG. 23 or 24) to receive and process data or servicedata (for example, broadcasting data) transmitted from the transmitter100.

The outer encoding is a coding operation which is performed before innerencoding in a concatenated coding operation, and may use variousencoding schemes such as Bose, Chaudhuri, Hocquenghem (BCH) encodingand/or cyclic redundancy check (CRC) encoding. In this case, an innercode for inner encoding may be an LDPC code.

For example, the outer encoder 110 may perform outer encoding on K_(sig)bits to generate M_(outer) parity bits and add the parity bits to theinput bits to output outer-encoded bits formed ofN_(outer)(=K_(sig)+M_(outer)) bits. In this case, the outer-encoded bitsmay include the input bits and the parity bits.

For convenience of explanation, the outer encoding will be describedbelow under an assumption that it is performed by a BCH code and BCHencoding.

That is, the BCH encoder 110 performs encoding, that is, the BCHencoding, on the input bits to generate the parity check bits, that is,BCH parity-check bits (or, BCH parity bits).

For example, the BCH encoder 110 may systematically perform the BCHencoding on the input K_(sig) bits to generate M_(outer) number ofparity check bits, that is, BCH parity-check bits, and add the BCHparity-check bits to the input bits to output BCH encoded bits formed ofN_(outer)(=K_(sig)+M_(outer)) bits, that is, the BCH encoded bitsincluding the input bits and the BCH parity-check bits. In this case,M_(outer)=168.

The zero padder 120 configures LDPC information bits which include theouter-encoded bits (that is, the input bits and the parity bits) andzero bits (that is, bits having a 0 value). Further, the zero padder 120may output the LDPC information bits to the LDPC encoder 130.

For an LDPC code and LDPC encoding, a specific number of LDPCinformation bits depending on a code rate and a code length arerequired. Therefore, when the number of BCH encoded bits is less thanthe number of information bits required for LDPC encoding, the zeropadder 120 may pad an appropriate number of zero bits to obtain therequired number of LDPC information bits. Therefore, the BCH encodedbits and the padded zero bits may configure the LDPC information bits asmany as the number of bits required for the LDPC encoding.

Since the padded zero bits are bits required to obtain the specificnumber of bits for the LDPC encoding, the padded zero bits areLDPC-encoded, and then, are not transmitted to the receiver 200. Assuch, a procedure of padding the zero bits or a procedure of paddingzero bits and then not transmitting the padded zero bits to the receiver200 may be referred to as shortening. In this case, the padded zero bitsmay be referred to as shortening bits (or shortened bits).

For example, when the number N_(outer) of BCH encoded bits is less thanthe number K_(ldpc) of LDPC information bits required for LDPC encoding,the transmitter 100 may pad K_(ldpc)−N_(outer) zero bits to some of LDPCinformation bits to generate LDPC information bits formed of K_(ldpc)bits. Therefore, K_(ldpc)−N_(outer) zero bits are added toK_(sig)+M_(outer) BCH encoded bits to generateK_(sig)+M_(outer)+K_(ldpc)−N_(outer) LDPC information bits.

For this purpose, the zero padder 120 may divide the LDPC informationbits into a plurality of bit groups.

In detail, the zero padders 120 may divide the LDPC information bitsinto the plurality of bit groups so that the number of bits included ineach bit group is 360.

For example, the zero padder 120 may divide K_(ldpc) LDPC informationbits (i₀, i₁, . . . , i_(K) _(ldpc) ⁻¹) into N_(info) _(_)_(group)(=K_(ldpc)/360) bit groups based on following Equation 1 or 2.

$\begin{matrix}{{Z_{j} = \left\{ {{{i_{k}j} = \left\lfloor \frac{k}{360} \right\rfloor},{0 \leq k < K_{ldpc}}} \right\}}{for}{0 \leq j < N_{info\_ group}}} & (1) \\{{Z_{j} = \left\{ {i_{k}{{360 \times j} \leq k < {360 \times \left( {j + 1} \right)}}} \right\}}{for}{0 \leq j < N_{info\_ group}}} & (2)\end{matrix}$

In above Equations 1 and 2, Z_(j) represents a j-th bit group. Here, └x┘represents a maximum integer which is not greater than x.

Meanwhile, FIG. 2 illustrates an example in which LDPC information bitsare divided into a plurality of bit groups, according to an exemplaryembodiment. However, FIG. 2 illustrates LDPC information bits and LDPCparity bits (that is, LDPC FEC) generated by performing LDPC encoding onthe LDPC information bits together.

Referring to FIG. 2, K_(ldpc) LDPC information bits are divided into theN_(info) _(_) _(group) bits groups and each bit group Z is formed of 360bits.

For example, it is assumed that the number K_(ldpc) of LDPC informationbits is 6480. In this case, if the LDPC information bits are dividedinto a plurality of groups so that the number of bits included in eachbit group is 360, the LDPC information bits may be divided into 18(=6480/360) bit groups.

Hereinafter, a shortening procedure performed by the zero padder 120will be described in more detail.

The zero padders 120 and 314 may calculate the number of zero bits to bepadded. That is, to fit the number of bits required for the LDPCencoding, the zero padder 120 may calculate the number of zero bits tobe padded.

In detail, the zero padder 120 may calculate a difference between thenumber of LDPC information bits required for the LDPC encoding and thenumber of BCH encoded bits as the number of padded zero bits. That is,when N_(outer)(=K_(sig)+M_(outer)) is less than K_(ldpc), the zeropadder 120 may calculate the number of zero bits to be padded as(K_(ldpc)−N_(outer)).

Further, the zero padder 120 may calculate the number N_(pad) of bitgroups in which all bits are to be padded by zero bits, based onfollowing Equation 3 or 4.

$\begin{matrix}{N_{pad} = \left\lfloor \frac{K_{ldpc} - N_{outer}}{360} \right\rfloor} & (3) \\{N_{pad} = \left\lfloor \frac{\left( {K_{ldpc} - M_{outer}} \right) - K_{sig}}{360} \right\rfloor} & (4)\end{matrix}$

Further, the zero padder 120 pads zero bits to at least some of aplurality of bit groups configuring the LDPC information bits, based ona shortening pattern.

In detail, the zero padder 120 may determine bit groups in which zerobits are to be padded among the plurality of bit groups configuring theLDPC information bits based on the shortening pattern, and may pad zerobits to all bits within some of the determined bit groups and some bitswithin the remaining bit groups.

Here, the shortening pattern may be defined as following Table 1. Inthis case, following Table 1 shows the shortening pattern which isapplied to the case in which the LDPC encoder 130 performs LDPC encodingon 6480 LDPC information bits at a code rate of 6/15 to generate 9720LDPC parity bits.

LDPC codeword bits except the padded zero bits in an LDPC codewordformed of the LDPC information bits and the LDPC parity bits may betransmitted to the receiver 200. In this case, the shortened LDPCcodeword (that is, the remaining LDPC codeword except the shortened bitswhich may also be referred to as the shortened LDPC codeword) may bemodulated by 64-quadrature amplitude modulation (QAM) to be transmittedto the receiver 200.

TABLE 1 π_(S)(j) (0 ≦ j < N_(info) _(—) _(group)) π_(S)(0) π_(S)(1)π_(S)(2) π_(S)(3) π_(S)(4) π_(S)(5) π_(S)(6) π_(S)(7) π_(S)(8) N_(info)_(—) _(group) π_(S)(9) π_(S)(10) π_(S)(11) π_(S)(12) π_(S)(13) π_(S)(14)π_(S)(15) π_(S)(16) π_(S)(17) 18 2 4 5 17 9 7 1 6 15 8 10 14 16 0 11 1312 3

That is, π_(s)(j) represents a shortening pattern order of a j-th bitgroup. Further, N_(info) _(_) _(group) is the number of plural bitgroups configuring LDPC information bits.

In detail, the zero padder 120 may determine a bit group in which allbits within the bit group are padded by zero bits based on theshortening pattern, and pad zero bits to all bits of the determined bitgroup.

That is, the zero padder 120 may determine Z_(π) _(s) ₍₀₎, Z_(π) _(s)₍₁₎, . . . , Z_(π) _(s) _((N) _(pad) ⁻¹⁾ as bit groups in which all bitsare padded by zero bits based on the shortening pattern, and pad zerobits to all bits of the determined bit groups. That is, the zero padder120 may pad zero bits to all bits of a π_(s)(0)-th bit group, aπ_(s)(1)-th bit group, . . . , a π_(s)(N_(pad)−1)-th bit group among theplurality of bit groups based on the shortening pattern.

As such, the zero padder 120 may determine N_(pad) bit groups, that is,Z_(π) _(s) ₍₀₎, Z_(π) _(s) ₍₁₎, . . . , Z_(π) _(s) _((N) _(pad) ⁻¹⁾based on the shortening pattern, and pad zero bits to all bits withinthe determined bit group.

Meanwhile, since the total number of padded zero bits isK_(ldpc)−N_(outer), and the number of bit groups in which all bits arepadded by zero bits is N_(pad), the zero padder 120 may additionally padK_(ldpc)−N_(outer)−360×N_(pad) zero bits.

In this case, the zero padder 120 may determine a bit group to whichzero bits are additionally padded based on the shortening pattern, andmay additionally pad zero bits from a beginning portion of thedetermined bit group.

In detail, the zero padder 213 may determine Z_(π) _(s) _((N) _(pad) ₎as a bit group to which zero bits are additionally padded based on theshortening pattern, and may additionally pad zero bits to theK_(ldpc)−N_(outer)−360×N_(pad) bits positioned at the beginning portionof Z_(π) _(s) _((N) _(pad) ₎. Therefore, theK_(ldpc)−N_(outer)−360×N_(pad) zero bits may be padded from a first bitof the π_(s)(N_(pad))-th bit group.

Therefore, zero bits may be padded only to some of the Z_(π) _(s) _((N)_(pad) ₎, and the K_(ldpc)−N_(outer)−360×N_(pad) zero bits may be paddedfrom the first LDPC information bit of the Z_(π) _(s) _((N) _(pad) ₎.

Next, the zero padder 213 may map the BCH-encoded bits to the positionsat which zero bits are not padded among the LDPC information bits tofinally configure the LDPC information bits.

Therefore, N_(outer) BCH-encoded bits may be sequentially mapped to thebit positions at which zero bits in the K_(ldpc) LDPC information bits(i₀, i₁, . . . , i_(K) _(ldpc) ⁻¹).

Hereinafter, a method for padding zero bits will be described in detailwith reference to a case in which K_(ldpc)=6480 and N_(outer)=568 as anexample. In this case, the LDPC information bits may be divided into14=6480/360) bit groups.

First, the zero padder 120 may calculate the number of zero bits to bepadded to the LDPC information bits. In this case, the number of zerobits to be padded is 5912(=K_(ldpc)−N_(outer)=6480−568).

Further, the zero padder 120 may calculate the number

$16 = {N_{pad} = \left\lfloor \frac{6480 - 568}{360} \right\rfloor}$

of bit groups in which all bits are padded by zero bits.

Further, the zero padder 120 may determine Z₂(=Z_(πs(0)), Z₄(=Z_(πs(1)),. . . , Z₁₁(=Z_(πs(14))) and Z₁₃(=Z_(πs(15))) as bit groups in which allbits are padded by zero bits based on the shortening pattern, and padzero bits to all bits of Z₂(=Z_(πs(0))), Z₄(=Z_(πs(1))), . . . ,Z₁₁(=Z_(πs(14))) and Z₁₃(=Z_(πs(15))).

Therefore, all bits of a 2-th bit group, a 4-th bit group, . . . , an11-th bit group and a 13-th bit group may be padded by zero bits.

Further, the zero padder 120 may determine Z₁₂(=Z_(πs(16)) as a bitgroup to which zero bits are additionally padded based on the shorteningpattern, and may additionally pad 152(=K_(ldpc)−N_(outer)−360×N_(pad)=6480−568−360×16) zero bits to thebeginning portion of Z₁₂(=Z_(πs(16))).

Therefore, zero bits from a first bit to a 152-th bit may be padded to a12-th bit group.

As a result, the zero bits may be padded to all LDPC information bits ofa 2-th bit group, a 4-th bit group, a 5-th bit group, a 17-th bit group,a 9-th bit group, a 7-th th group, a 1-th bit group, a 6-th bit group, a15-th bit group, a 8-th bit group, a 10-th bit group, a 14-th bit group,a 16-th bit group, a 0-th bit group, a 11-th bit group, and a 13-th bitgroup among 18 bit groups configuring the LDPC information bits, thatis, a 0-th bit group to a 17-th bit group, and zero bits may beadditionally padded from a first LDPC information bit to a 152-th LDPCinformation bit of a 12-th bit group.

Next, the zero padder 120 may sequentially map BCH-encoded bits to thebit positions at which zero bits are not padded in the LDPC informationbits.

For example, since the number N_(outer) of BCH encoded bits is 568, whenthe BCH encoded bits are s₀, s₁, . . . , s₅₆₇, the zero padder 120 maymap s₀, s₁, . . . , s₂₀₇ to a 153-th LDPC information bit to a 360-thLDPC information bit of the third bit group and map s₂₀₈, s₂₀₉, . . . ,s₅₆₇ to all LDPC information bits of a 3-th bit group.

As such, the zero padder 120 may pad zero bits to appropriate positionsto fit the number of bits required for LDPC encoding, thereby to finallyconfigure the LDPC information bits for the LDPC encoding.

The foregoing example describes that the information bits areouter-encoded, which is only one example. That is, the information bitsmay not be outer-encoded, and instead, may configure the LDPCinformation bits along with zero bits thereto depending on the number ofinformation bits.

The foregoing example describes that zero bits, which will be shortened,are padded, which is only one example. That is, since zero bits are bitshaving a value preset by the transmitter 100 and the receiver 200 andpadded only to form LDPC information bits along with information bitsincluding information to be substantially transmitted to the receiver200, bits having another value (for example, 1) preset by thetransmitter 100 and the receiver 200 instead of zero bits may be paddedfor shortening.

The LDPC encoder 130 performs encoding, that is, LDPC encoding on theLDPC information bits.

In detail, the LDPC encoder 130 may systematically perform the LDPCencoding on the LDPC information bits to generate LDPC parity bits, andoutput an LDPC codeword (or LDPC-encoded bits) formed of the LDPCinformation bits and the LDPC parity bits. That is, an LDPC code for theLDPC encoding is a systematic code, and therefore, the LDPC codeword maybe formed of the LDPC information bits before being LDPC-encoded and theLDPC parity bits generated by the LDPC encoding.

For example, the LDPC encoder 130 may perform the LDPC encoding onK_(ldpc) LDPC information bits i=(i₀, i₁, . . . , i_(K) _(ldpc) ⁻¹) togenerate N_(ldpc) _(_) _(parity) LDPC parity bits (p₀, p₁, . . . , p_(N)_(inner) _(−K) _(ldpc) ⁻¹) and output an LDPC codeword Λ=(c₀, c₁, . . ., c_(N) _(inner) ⁻¹)=(i₀, i₁, . . . , i_(K) _(ldpc) ⁻¹, p₀, p₁, . . . ,p_(N) _(inner) _(−K) _(ldpc) ⁻¹) formed of N_(inner)(=K_(ldpc)+N_(ldpc)_(_) _(parity)) bits.

In this case, the LDPC encoder 110 may perform the LDPC encoding on theinput bits (i.e., LDPC information bits) at various code rates togenerate an LDPC codeword having a predetermined length.

For example, the LDPC encoder 110 may perform LDPC encoding on 3240input bits at a code rate of 3/15 to generate an LDPC codeword formed of16200 bits. As another example, the LDPC encoder 110 may perform LDPCencoding on 6480 input bits at a code rate of 6/15 to generate an LDPCcodeword formed of 16200 bits.

A process of performing LDPC encoding is a process of generating an LDPCcodeword to satisfy H·C^(T)=0, and thus, the LDPC encoder 110 may use aparity check matrix to perform the LDPC encoding. Here, H represents theparity check matrix and C represents the LDPC codeword.

Hereinafter, a structure of the parity check matrix according to variousexemplary embodiments will be described with reference to theaccompanying drawings. In the parity check matrix, elements of a portionother than 1 are 0.

As one example, the parity check matrix according to an exemplaryembodiment may have a structure as illustrated in FIG. 3.

Referring to FIG. 3, a parity check matrix 20 may be formed of fivesub-matrices A, B, C, Z and D. Hereinafter, for describing the structureof the parity check matrix 20, each matrix structure will be described.

The sub-matrix A is formed of K columns and g rows, and the sub-matrix Cis formed of K+g columns and N−K−g rows. Here, K (or K_(ldpc))represents a length of LDPC information bits and N (or N_(inner))represents a length of an LDPC codeword.

Further, in the sub-matrices A and C, indexes of a row in which 1 ispositioned in a 0-th column of an i-th column group may be defined basedon Table 2 when the length of the LDPC codeword is 16200 and the coderate is 3/15. The number of columns belonging to a same column group maybe 360.

TABLE 2 8 372 841 4522 5253 7430 8542 9822 10550 11896 11988 80 255 6671511 3549 5239 5422 5497 7157 7854 11267 257 406 792 2916 3072 3214 36384090 8175 8892 9003 80 150 346 1883 6838 7818 9482 10366 10514 1146812341 32 100 978 3493 6751 7787 8496 10170 10318 10451 12561 504 803 8562048 6775 7631 8110 8221 8371 9443 10990 152 283 696 1164 4514 4649 72607370 11925 11986 12092 127 1034 1044 1842 3184 3397 5931 7577 1189812339 12689 107 513 979 3934 4374 4658 7286 7809 8830 10804 10893 20452499 7197 8887 9420 9922 10132 10540 10816 11876 2932 6241 7136 78358541 9403 9817 11679 12377 12810 2211 2288 3937 4310 5952 6597 969210445 11064 11272

Hereinafter, positions (alternatively referred to as “indexes” or “indexvalues”) of a row in which 1 is positioned in the sub-matrices A and Cwill be described in detail with reference to, for example, Table 2.

When the length of an LDPC codeword is 16200 and the code rate is 3/15,coding parameters M₁, M₂, Q₁ and Q₂ based on the parity check matrix 200each are 1080, 11880, 3 and 33.

Here, Q₁ represents a size at which columns belonging to a same columngroup in the sub-matrix A are cyclic-shifted, and Q₂ represents a sizeat which columns belonging to a same column group in the sub-matrix Care cyclic-shifted.

Further, Q₁=M₁/L, Q₂=M₂/L, M₁=g, M₂=N−K−g and L represents an intervalat which patterns of a column are repeated in the sub-matrices A and C,respectively, that is, the number (for example, 360) of columnsbelonging to a same column group.

The indexes of the row in which 1 is positioned in the sub-matrices Aand C, respectively, may be determined based on an M₁ value.

For example, in above Table 2, since M₁=1080, the position of a row inwhich 1 is positioned in a 0-th column of an i-th column group in thesub-matrix A may be determined based on values less than 1080 amongindex values of above Table 2, and the position of a row in which 1 ispositioned in a 0-th column of an i-th column group in the sub-matrix Cmay be determined based on values equal to or greater than 1080 amongthe index values of above Table 2.

In detail, a sequence corresponding to a 0-th column group in aboveTable 2 is “8 372 841 4522 5253 7430 8542 9822 10550 11896 11988”.Therefore, in a 0-th column of a 0-th column group in the sub-matrix A,1 may be positioned in an eighth row, a 372-th row, and an 841-th row,respectively, and in a 0-th column of a 0-th column group in thesub-matrix C, 1 may be positioned in a 4522-th row, a 5253-th row, a7430-th row, an 8542-th row, a 9822-th row, a 10550-th row, a 11896-throw, and a 11988-row, respectively.

In the sub-matrix A, when the position of 1 is defined in a 0-th columnsof each column group, it may be cyclic-shifted by Q₁ to define aposition of a row in which 1 is positioned in other columns of eachcolumn group, and in the sub-matrix C, when the position of 1 is definedin a 0-th columns of each column group, it may be cyclic-shifted by Q₂to define a position of a row in which 1 is positioned in other columnsof each column group.

In the foregoing example, in the 0-th column of the 0-th column group inthe sub-matrix A, 1 is positioned in an eighth row, a 372-th row, and an841-th row. In this case, since Q₁=3, indexes of a row in which 1 ispositioned in a first column of the 0-th column group may be 11(=8+3),375(=372+3), and 844(=841+3) and indexes of a row in which 1 ispositioned in a second column of the 0-th column group may be 14(=11+3),378(=375+3), and 847(=844+3).

In a 0-th column of a 0-th column group in the sub-matrix C, 1 ispositioned in a 4522-th row, a 5253-th row, a 7430-th row, an 8542-throw, a 9822-th row, a 10550-th row, a 11896-th row, and a 11988-th row.In this case, since Q₂=33, the indexes of the row in which 1 ispositioned in a first column of the 0-th column group may be4555(=4522+33), 5286(=5253+33), 7463(=7430+33), 8575(=8542+33),9855(=9822+33) 10583(=10550+33), 11929(=11896+33), and 12021(=11988+33)and the indexes of the row in which 1 is positioned in a second columnof the 0-th column group may be 4588(=4555+33), 5319(=5286+33),7496(=7463+33), 8608(=8575+33), 9888(=9855+33), 10616(=10583+33),11962(=11929+33), and 12054(=12021+33).

According to the scheme, the positions of the row in which 1 ispositioned in all the column groups in the sub-matrices A and C may bedefined.

The sub-matrix B is a dual diagonal matrix, the sub-matrix D is anidentity matrix, and the sub-matrix Z is a zero matrix.

As a result, the structure of the parity check matrix 20 as illustratedin FIG. 2 may be defined by the sub-matrices A, B, C, D and Z having theabove structure.

Hereinafter, a method for performing, by the LDPC encoder 110, LDPCencoding based on the parity check matrix 20 as illustrated in FIG. 2will be described.

An LDPC code may be used to encode an information block S=(s₀, s₁, . . ., s_(K+1)), In this case, to generate an LDPC codeword Λ=(λ₀, λ₁, . . ., λ_(N-1)) having a length of N=K+M₁+M₂, parity blocks P=(p₀, p₁, . . ., p_(M) ₁ _(+M) ₂ ⁻¹) from the information block S may be systematicallyencoded.

As a result, the LDPC codeword may be Λ=(s₀, s₁, . . . , s_(K+1), p₀,p₁, . . . , p_(M) ₁ _(+M) ₂ ⁻¹).

Here, M₁ and M₂ each represent a size of parity sub-matricescorresponding to the dual diagonal sub-matrix B and the identity matrixsub-D, respectively, in which M₁=g and M₂=N−K−g.

A process of calculating parity bits may be represented as follows.Hereinafter, for convenience of explanation, a case in which the paritycheck matrix 20 is defined as above Table 2 will be described as oneexample.

Step 1) λ_(i) is initialized to be s_(i) (i=0, 1, . . . , K−1) and p_(j)is initialized to be 0 (j=0, 1, . . . , M₁+M₂−1).

Step 2) A first information bit λ₀ is accumulated in a parity bitaddress defined in the first row of above Table 2.

Step 3) For the next L−1 information bits λ_(m) (m=1, 2, . . . , L−1),λ_(m) is accumulated in the parity bit address calculated based onfollowing Expression 5.

(x+m×Q ₁)mod M ₁ (if x<M ₁)

M ₁{(x−M ₁ +m×Q ₂)mod M ₂} (if x≧M ₁)  (5)

In above Expression 5, x represents an address of a parity bitaccumulator corresponding to a first information bit λ₀.

Further, Q₁=M₁/L and Q₂=M₂/L. In this case, since the length of the LDPCcodeword is 16200 and the code rate is 3/15, M₁=1080, M₂=11880, Q₁=3,Q₂=33, L=360.

Step 4) Since the parity bit address like the second row of above Table2 is given to an L-th information bit λ_(L), similar to the foregoingscheme, the parity bit address for next L−1 information bits λ_(m)(m=L+1, L+2, 2L−1) is calculated by the scheme described in the abovestep 3. In this case, x represents the address of the parity bitaccumulator corresponding to the information bit λ_(L) and may beobtained based on the second row of above Table 2.

Step 5) For L new information bits of each group, the new rows of aboveTable 2 are set as the address of the parity bit accumulator, and thus,the foregoing process is repeated.

Step 6) After the foregoing process is repeated from the codeword bit λ₀to λ_(K+1), a value for following Equation 6 is sequentially calculatedfrom i=1.

P _(i) =P _(i) ⊕P _(i-1) (i=1,2, . . . M ₁−1)   (6)

Step 7) The parity bits λ_(K) to λ_(K+M) ₁ ⁻¹ corresponding to the dualdiagonal sub-matrix B are calculated based on following Equation 7.

λ_(K+L×t+s) =p _(Q) ₁ _(×s+t) (0≦s<L,0≦t<Q ₁)   (7)

Step 8) The address of the parity bit accumulator for the L new codewordbits λ_(K) to λ_(K+M) ₁ ⁻¹ of each group is calculated based on the newrow of above Table 2 and above Expression 5.

Step 9) After the codeword bits λ_(K) to λ_(K+M) ₁ ⁻¹ are applied, theparity bits λ_(K+M) ₁ to λ_(K+M) ₁ _(+M) ₂ ⁻¹ corresponding to thesub-matrix D are calculated based on following Equation 8.

λ_(K+M) ₁ _(+L×t+s) =p _(M) ₁ _(+Q) ₂ _(×s+t) (0≦s<L,0≦t<Q ₂)   (8)

As a result, the parity bits may be calculated by the above scheme.However, this is only one example and therefore the scheme forcalculating the parity bits based on the parity check matrix asillustrated in FIG. 3 may be variously defined.

As such, the LDPC encoder 130 may perform the LDPC encoding based onabove Table 2 to generate the LDPC codeword.

In detail, the LDPC encoder 130 may perform the LDPC encoding on 3240input bits, that is, the LDPC information bits at the code rate of 3/15based on above Table 2 to generate 12960 LDPC parity bits and output theLDPC parity bits and the LDPC codeword formed of the LDPC parity bits.In this case, the LDPC codeword may be formed of 16200 bits.

As another example, the parity check matrix according to the exemplaryembodiment may have a structure as illustrated in FIG. 4.

Referring to FIG. 4, a parity check matrix 40 is formed of aninformation sub-matrix 41 which is a sub-matrix corresponding to theinformation bits (that is, LDPC information bits) and a paritysub-matrix 42 which is a sub-matrix corresponding to the parity bits(that is, LDPC parity bits).

The information sub-matrix 41 includes K_(ldpc) columns and the paritysub-matrix 42 includes N_(ldpc) _(_) _(parity)=N_(inner)−K_(ldpc)columns. The number of rows of the parity check matrix 40 is equal tothe number N_(ldpc) _(_) _(parity)=N_(inner)−K_(ldpc) of columns of theparity sub-matrix 42.

Further, in the parity check matrix 40, N_(inner) represents the lengthof the LDPC codeword, K_(ldpc) represents the length of the informationbits, and N_(ldpc) _(_) _(parity)=N_(inner)−K_(lapp) represents thelength of the parity bits.

Hereinafter, the structures of the information sub-matrix 41 and theparity sub-matrix 42 will be described.

The information sub-matrix 41 is a matrix including the K_(ldpc) columns(that is, 0-th column to (K_(ldpc)−1)-th column) and depends on thefollowing rule.

First, the K_(ldpc) columns configuring the information sub-matrix 41belong to the same group by M numbers and are divided into a total ofK_(ldpc)/M column groups. The columns belonging to the same column grouphave a relationship that they are cyclic-shifted by Q_(ldpc) from oneanother. That is, Q_(ldpc) may be considered as a cyclic shift parametervalue for columns of the column group in the information sub-matrixconfiguring the parity check matrix 40.

Here, M represents an interval (for example, M=360) at which the patternof columns in the information sub-matrix 41 is repeated and Q_(ldpc) isa size at which each column in the information sub-matrix 31 iscyclic-shifted. M is a common divisor of N_(inner) and K_(ldpc), and isdetermined so that Q_(ldpc)=(N_(inner)−K_(ldpc))/M is established. Here,M and Q_(ldpc) are integers and K_(ldpc)/M also becomes an integer. Mand Q_(ldpc) may have various values depending on the length of the LDPCcodeword and the code rate.

For example, when M=360, the length N_(inner) of the LDPC codeword is16200, and the code rate is 6/15, Q_(ldpc) may be 27.

Second, if a degree (herein, the degree is the number of values 1spositioned in a column and the degrees of all columns belonging to asame column group are the same) of a 0-th column of an i-th (i=0, 1, . .. , K_(ldpc)/M−1) column group is set to be D_(i) and positions (orindex) of each row in which 1 is positioned in the 0-th column of thei-th column group is set to be R_(i,0) ⁽⁰⁾, R_(i,0) ⁽¹⁾, . . . , R_(i,0)^((D) ^(i) ⁻¹⁾, an index R_(i,j) ^((k)) of a row in which a k-th 1 ispositioned in a j-th column in the i-th column group is determined basedon following Equation 9.

R _(i,j) ^((k)) =R _(i,(j-1)) ^((k)) +Q _(ldpc) mod(N _(inner) −K_(ldpc))   (9)

In above Equation 9, k=0, 1, 2, . . . , D_(i)−1; i=0, 1, . . . ,K_(ldpc)/M−1; j=1, 2, . . . , M−1.

Meanwhile, above Equation 9 may be represented like following Equation10.

R _(i,j) ^((k))=(R _(1,0) ^((k))+(j mod M)×Q _(ldpc))mod(N _(inner) −K_(ldpc))   (10)

In above Equation 10, k=0, 1, 2, . . . , D_(i)−1; i=0, 1, . . . ,K_(ldpc)/M−1; j=1, 2, . . . , M−1. In above Equation 10, since j=1, 2, .. . , M−1, (j mod M) may be considered as j.

In these Equations, R_(i,j) ^((k)) represents the index of a row inwhich a k-th 1 is positioned in a j-th column in an i-th column group,N_(inner) represents the length of an LDPC codeword, K_(ldpc) representsthe length of information bits, D_(i) represents the degree of columnsbelonging to the i-th column group, M represents the number of columnsbelonging to one column group, and Q_(ldpc) represents the size at whicheach column is cyclic-shifted.

As a result, referring to the above equations, if a R_(i,0) ^((k)) valueis known, the index R_(i,j) ^((k)) of the row in which the k-th 1 ispositioned in the j-th column in the i-th column group may be known.Therefore, when the index value of the row in which the k-th 1 ispositioned in a 0-th columns of each column group is stored, thepositions of the column and the row in which 1 is positioned in theparity check matrix 40 (that is, information sub-matrix 41 of the paritycheck matrix 40) having the structure of FIG. 4 may be checked.

According to the foregoing rules, all degrees of columns belonging tothe i-th column group are D_(i). Therefore, according to the foregoingrules, an LDPC code in which the information on the parity check matrixis stored may be briefly represented as follows.

For example, when N_(inner) is 30, K_(ldpc) is 15, and Q_(ldpc), is 3,positional information of the row in which 1 is positioned in 0-thcolumns of three column groups may be represented by sequences asfollowing Equation 11, which may be named ‘weight-1 position sequence’.

R _(1,0) ⁽¹⁾=1,R _(1,0) ⁽²⁾=2,R _(1,0) ⁽³⁾=8,R _(1,0) ⁽⁴⁾=10,

R _(2,0) ⁽¹⁾=0,R _(2,0) ⁽²⁾=9,R _(2,0) ⁽³⁾=13,

R _(3,0) ⁽¹⁾=0,R _(3,0) ⁽²⁾=14,   (11)

In above Equation 11, R_(i,j) ^((k)) represents the indexes of the rowin which the k-th 1 is positioned in the j-th column of the i-th columngroup.

The weight-1 position sequences as above Equation 11 representing theindex of the row in which 1 is positioned in the 0-th columns of eachcolumn group may be more briefly represented as following Table 3.

TABLE 3 1 2 8 10 0 9 13 0 14

Above Table 3 represents positions of elements having a value 1 in theparity check matrix and the i-th weight-1 position sequence isrepresented by the indexes of the row in which 1 is positioned in the0-th column belonging to the i-th column group.

The information sub-matrix 41 of the parity check matrix according tothe exemplary embodiment described above may be defined based onfollowing Table 4.

Here, following Table 4 represents the indexes of the row in which 1 ispositioned in a 0-th column of the i-th column group in the informationsub-matrix 41. That is, the information sub-matrix 41 is formed of aplurality of column groups each including M columns and the positions ofis in the 0-th columns of each of the plurality of column groups may bedefined as following Table 4.

For example, when the length N_(inner) of the LDPC codeword is 16200,the code rate is 6/15, and the M is 360, the indexes of the row in which1 is positioned in the 0-th column of the i-th column group in theinformation sub-matrix 41 are as following Table 4.

TABLE 4 27 430 519 828 1897 1943 2513 2600 2640 3310 3415 4266 5044 51005328 5483 5928 6204 6392 6416 6602 7019 7415 7623 8112 8485 8724 89949445 9667 27 174 188 631 1172 1427 1779 2217 2270 2601 2813 3196 35823895 3908 3948 4463 4955 5120 5809 5988 6478 6504 7096 7673 7735 77958925 9613 9670 27 370 617 852 910 1030 1326 1521 1606 2118 2248 29293214 3413 3623 3742 3752 4317 4694 5300 5687 6039 6100 6232 6491 66216860 7304 8542 8634 990 1753 7635 8540 933 1435 5666 8745 27 6567 87079216 2341 8692 9580 9615 260 1092 5839 6080 352 3750 4847 7726 4610 65809506 9597 2512 2974 4814 9148 1461 4021 5060 7009 1796 2883 5553 83061249 5427 7057 1955 6968 9422 1498 2931 5092 27 1090 6215 26 4232 6354

According to another exemplary embodiment, a parity check matrix inwhich an order of indexes in each sequence corresponding to each columngroup in above Table 4 is changed is considered as a same parity checkmatrix for an LDPC code as the above described parity check matrix isanother example of the inventive concept.

According to still another exemplary embodiment, a parity check matrixin which an array order of the sequences of the column groups in aboveTable 4 is changed is also considered as a same parity check matrix asthe above described parity check matrix in that they have a samealgebraic characteristics such as cyclic characteristics and degreedistributions on a graph of a code.

According to yet another exemplary embodiment, a parity check matrix inwhich a multiple of Q_(ldpc) is added to all indexes of a sequencecorresponding to column group in above Table 4 is also considered as asame parity check matrix as the above described parity check matrix inthat they have same cyclic characteristics and degree distributions onthe graph of the code. Here, it is to be noted that when a valueobtained by adding an integer multiple of Q_(ldpc) to a given sequenceis greater than or equal to N_(inner)−K_(ldpc), the value needs to bechanged to a value obtained by performing a modulo operation onN_(inner)−K_(ldpc) and then applied.

If the position of the row in which 1 is positioned in the 0-th columnof the i-th column group in the information sub-matrix 41 as shown inabove Table 4 is defined, it may be cyclic-shifted by Q_(ldpc), andthus, the position of the row in which 1 is positioned in other columnsof each column group may be defined.

For example, as shown in above Table 4, since the sequence correspondingto the 0-th column of the 0-th column group of the informationsub-matrix 31 is “27 430 519 828 1897 1943 2513 2600 2640 3310 3415 42665044 5100 5328 5483 5928 6204 6392 6416 6602 7019 7415 7623 8112 84858724 8994 9445 9667”, in the 0-th column of the 0-th column group in theinformation sub-matrix 31, 1 is positioned in a 27-th row, a 430-th row,a 519-th-row, . . . .

In this case, since Q_(ldpc)=(N_(inner)−K_(ldpc))/M=(16200−6480)/360=27,the indexes of the row in which 1 is positioned in the first column ofthe 0-th column group may be 54(=27+27), 457(=430+27), 546(=519+27), . .. , 81(=54+27), 484(=457+27), 573(=546+27),

By the above scheme, the indexes of the row in which 1 is positioned inall the rows of each column group may be defined.

Hereinafter, the method for performing LDPC encoding based on the paritycheck matrix 40 as illustrated in FIG. 4 will be described.

First, information bits to be encoded are set to be i₀, i₁, . . . ,i_(K) _(ldpc) ⁻¹, and code bits output from the LDPC encoding are set tobe c₀, c₁, . . . , c_(N) _(inner) ⁻¹.

Further, since an LDPC code is systematic, for k (0≦k<K_(ldpc)−1), c_(k)is set to be i_(k). The remaining code bits are set to be p_(k):=c_(k+k)_(ldpc) .

Hereinafter, a method for calculating parity bits p_(k) will bedescribed.

Hereinafter, q(i,j,0) represents a j-th entry of an i-th row in an indexlist as above Table 4, and q(i,j,1) is set to be q(i,j,1)=q(i, j,0)+Q_(ldpc)×1 (mod N_(inner)−K_(ldpc)) for 0<i<360. All theaccumulations may be realized by additions in a Galois field (GF) (2).Further, in above Table 4, since the length of the LDPC codeword is16200 and the code rate is 6/15, the Q_(ldpc) is 27.

When the q(i,j,0) and the q(i,j,1) are defined as above, a process ofcalculating the parity bit is as follows.

Step 1) The parity bits are initialized to ‘0’. That is, p_(K)=0 for0≦k<N_(inner)−K_(ldpc).

Step 2) For all k values of 0≦k<K_(ldpc), i and 1 are set to bei:=└k/360┘ and 1:=k (mod 360). Here, └x┘ is a maximum integer which isnot greater than x.

Next, for all i, i_(k) is accumulated in p_(q(i,j,l)). That is,p_(q(i,0,l))=p_(q(i,0,l))+i_(k),p_(q(i,1,l))=p_(q(i,1,l))+i_(k),p_(q(i,2,l))=p_(q(i,2,l))+i_(k),. . . , p_(q(i,w(i)−1,l))=p_(q(i,w(i)−1,l))+i_(k) are calculated.

Here, w(i) represents the number of the values (elements) of an i-th rowin the index list as above Table 4 and represents the number of is in acolumn corresponding to i_(k) in the parity check matrix. Further, inabove Table 4, q(i, j, 0) which is a j-th entry of an i-th row is anindex of a parity bit and represents the position of the row in which 1is positioned in a column corresponding to i_(k) in the parity checkmatrix.

In detail, in above Table 4, q(i,j,0) which is the j-th entry of thei-th row represents the position of the row in which 1 is positioned inthe first (that is, 0-th) column of the i-th column group in the paritycheck matrix of the LDPC code.

The q(i, j, 0) may also be considered as the index of the parity bit tobe generated by LDPC encoding according to a method for allowing a realapparatus to implement a scheme for accumulating i_(k) in p_(q(i,j,l))for all i, and may also be considered as an index in another form whenanother encoding method is implemented. However, this is only oneexample, and therefore, it is apparent to obtain an equivalent result toan LDPC encoding result which may be obtained from the parity checkmatrix of the LDPC code which may basically be generated based on theq(i,j,0) values of above Table 4 whatever the encoding scheme isapplied.

Step 3) A parity bit p_(k) is calculated by calculatingp_(k)=p_(k)±p_(k+1) for all k satisfying 0<k<N_(inner)−K_(ldpc).

Accordingly, all code bits c₀, c₁, . . . , c_(N) _(inner) ⁻¹ may beobtained.

As a result, parity bits may be calculated by the above scheme. However,this is only one example and therefore the scheme for calculating theparity bits based on the parity check matrix as illustrated in FIG. 4may be variously defined.

As such, the LDPC encoder 130 may perform LDPC encoding based on aboveTable 4 to generate an LDPC codeword.

In detail, the LDPC encoder 130 may perform the LDPC encoding on 6480input bits, that is, the LDPC information bits at the code rate of 6/15based on above Table 4 to generate 9720 LDPC parity bits and output theLDPC parity bits and the LDPC codeword formed of the LDPC parity bits.In this case, the LDPC codeword may be formed of 16200 bits.

As described above, the LDPC encoder 130 may encode LDPC informationbits at various code rates to generate an LDPC codeword.

Here, when the zero padder 120 pads zero bits based on above Table 1,the LDPC encoder 130 may perform LDPC encoding on LDPC information bitsin which zero bits are padded at a code rate of 6/15. In this case, theLDPC information bits may be formed of 6480 bits and the LDPC paritybits generated by the LDPC encoding may be formed of 9720 bits.

The transmitter 100 may transmit the LDPC codeword to the receiver 200.

In detail, the transmitter 100 may map the shortened LDPC codeword bitsto constellation symbols by 64-QAM, map the symbols to a frame fortransmission to the receiver 200.

Since the information bits are signaling including signaling informationfor data, the transmitter 100 may map the data to a frame along with thesignaling for processing the data and transmit the mapped data to thereceiver 200.

In detail, the transmitter 100 may process the data in a specific schemeto generate the constellation symbols and map the generatedconstellation symbols to data symbols of each frame. Further, thetransmitter 100 may map the signaling for data mapped to each data to apreamble of the frame. For example, the transmitter 100 may map thesignaling including the signaling information for the data mapped to thei-th frame to the i-th frame.

As a result, the receiver 200 may use the signaling acquired from theframe to acquire and process the data from the corresponding frame.

Hereinafter, a process of inducing a shortening pattern for zero paddingwill be described as an example.

In detail, when the LDPC encoder 130 encodes 6480 LDPC information bitsat the code rate of 6/15 to generate 9720 LDPC parity bits and the LDPCcodeword generated by the LDPC encoding is modulated by 64-QAM and thenis transmitted to the receiver 200, a process of inducing a shorteningpattern for the zero padding is as follows.

The parity check matrix (for example, FIG. 4) of an LDPC code having thecode rate of 6/15 may be converted into the parity check matrix having aquasi cyclic structure configured of blocks having a size of 360×360 asillustrated in FIG. 5 by performing a column permutation process and anappropriate row permutation process corresponding to a parityinterleaving process. Here, the column permutation process and the rowpermutation process do not change algebraic characteristics of the LDPCcode, and therefore, have been widely used to theoretically analyze theLDPC code. Further, the parity check matrix having the quasi cyclicstructure has been already known, and therefore, the detaileddescription thereof will be omitted.

Obtaining a shortening pattern for zero padding may be considered as aproblem of defining a degree of importance between 18 column blocks ofan information bit portion present in an LDPC code having the code rateof 6/15. That is, shortening or zero padding specific information bitsis the same as shortening or removing columns corresponding to theinformation bits in the parity check matrix. Therefore, when n bitsamong an information word need to be shortened based on the length ofinput signaling, there is a need to determine which n columns are to beremoved from the parity check matrix in terms of bit error rate (BER) orframe error rate (FER) performance.

According to an exemplary embodiment, a shorting pattern for zeropadding is induced by using characteristics of the LDPC code, that is,columns within one column block (that is, a set of continued 360columns) having the same algebraic characteristics, and the total numberof information bit groups being only 18.

In a first step, the following nine situations are considered in aparity check matrix to measure the real BER and FER performance.

1. When the information is carried on only bits belonging to a 0-th bitgroup and the remaining bits are zero-padded.2. When information is carried on only bits belonging to a 1-th bitgroup and the remaining bits are zero-padded.3. When information is carried on only bits belonging to a 2-th bitgroup and the remaining bits are zero-padded.4. When information is carried on only bits belonging to a 3-th bitgroup and the remaining bits are zero-padded.5. When information is carried on only bits belonging to a 4-th bitgroup and the remaining bits are zero-padded.6. When information is carried on only bits belonging to a 5-th bitgroup and the remaining bits are zero-padded.7. When information is carried on only bits belonging to a 6-th bitgroup and the remaining bits are zero-padded.8. When information is carried on only bits belonging to a 7-th bitgroup and the remaining bits are zero-padded.9. When information is carried on only bits belonging to an 8-th bitgroup and the remaining bits are zero-padded.10. When information is carried on only bits belonging to a 9-th bitgroup and the remaining bits are zero-padded.11. When information is carried on only bits belonging to a 10-th bitgroup and the remaining bits are zero-padded.12. When information is carried on only bits belonging to a 11-th bitgroup and the remaining bits are zero-padded.13. When information is carried on only bits belonging to a 12-th bitgroup and the remaining bits are zero-padded.14. When information is carried on only bits belonging to a 13-th bitgroup and the remaining bits are zero-padded.15. When information is carried on only bits belonging to a 14-th bitgroup and the remaining bits are zero-padded.16. When information is carried on only bits belonging to a 15-th bitgroup and the remaining bits are zero-padded.17. When information is carried on only bits belonging to a 16-th bitgroup and the remaining bits are zero-padded.18. When information is carried on only bits belonging to a 17-th bitgroup and the remaining bits are zero-padded.

The BER and FER performance obtained under the nine situations areobserved. First, bit groups of which performance difference from thebest performance bit group is less than or equal to a predeterminedvalue (for example, 0.1 dB) are set as candidate bit groups to befinally shortened. To select a bit group to be finally shortened amongthe candidate bit groups, cyclic characteristics such as an approximatecycle extrinsic message (ACE) degree may be additionally considered. TheACE value of a cycle having a length of 2n is defined as a sum of valuesobtained by subtracting 2 from a degree of n variable nodes connected tothe cycle. Since a cycle having a small ACE value and a short lengthadversely affect performance of an LDPC code, a bit group, among thecandidate bit groups, which has the smallest cycle number among thenumber of cycles of which the length is less than or equal to 8 and ofwhich the ACE value is less than or equal to 3 in a matrix resultingfrom shortening column blocks corresponding to this bit group, may beselected. If there are too many number of such bit groups according tothe cyclic characteristics based on the ACE value, a theoreticalprediction value for a minimum signal-to-noise (SNR) which enableserror-free communication for ensembles of the LDPC code having a samedistribution of 1 after column deletion, row merging and row deletionfor each of these bit groups is derived by a density evolution analysis,and FER performance is verified by a computation experiment byappropriately adjusting the number of the bit groups based on theminimum SNR values theoretically predicted. As a result, the 5-th bitgroup may be selected.

In a second step for obtaining the shortening pattern, the real BER andFER performance is measured considering the following eight situations.

1. When information is carried on only bits belonging to the 0-th bitgroup and the 3-th bit group and the remaining bits are zero-padded.2. When information is carried on only bits belonging to the 1-th bitgroup and the 3-th bit group and the remaining bits are zero-padded.3. When information is carried on only bits belonging to the 2-th bitgroup and the 3-th bit group and the remaining bits are zero-padded.4. When information is carried on only bits belonging to the 3-th bitgroup and the 4-th bit group and the remaining bits are zero-padded.5. When information is carried on only bits belonging to the 3-th bitgroup and the 5-th bit group and the remaining bits are zero-padded.6. When information is carried on only bits belonging to the 3-th bitgroup and the 6-th bit group and the remaining bits are zero-padded.7. When information is carried on only bits belonging to the 3-th bitgroup and the 7-th bit group and the remaining bits are zero-padded.8. When information is carried on only bits belonging to the 3-th bitgroup and the 8-th bit group and the remaining bits are zero-padded.9. When information is carried on only bits belonging to the 3-th bitgroup and the 9-th bit group and the remaining bits are zero-padded.10. When information is carried on only bits belonging to the 3-th bitgroup and the 10-th bit group and the remaining bits are zero-padded.11. When information is carried on only bits belonging to the 3-th bitgroup and the 11-th bit group and the remaining bits are zero-padded.12. When information is carried on only bits belonging to the 3-th bitgroup and the 12-th bit group and the remaining bits are zero-padded.13. When information is carried on only bits belonging to the 3-th bitgroup and the 13-th bit group and the remaining bits are zero-padded.14. When information is carried on only bits belonging to the 3-th bitgroup and the 14-th bit group and the remaining bits are zero-padded.15. When information is carried on only bits belonging to the 3-th bitgroup and the 15-th bit group and the remaining bits are zero-padded.16. When information is carried on only bits belonging to the 3-th bitgroup and the 16-th bit group and the remaining bits are zero-padded.17. When information is carried on only bits belonging to the 3-th bitgroup and the 17-th bit group and the remaining bits are zero-padded.

The above eight situations are for situations in which selection of abit group to carry additional information is required in addition to the3-th bit group which is already selected in the first step. After theBER and FER performances obtained under these situations are observed, abit group having the best performance is selected as a candidate groupto be shortened just before shortening the 3-th bit group. Next, acolumn group corresponding to the 3-th bit group in the parity-checkmatrix is shortened and a bit group among the candidate bit groups to beshortened just before the 3-th bit group is shortened, and then, in thematrix left after the foregoing shortening, the number of cycle havingthe length less than or equal to 8 and the ACE value less than or equalto 3 may be checked to select a bit group of which the number of cyclesis smallest. For example, the 12-th bit group may be selected.

As a result, the above process is repeated until 18 bit groups of LDPCinformation bits may be selected to obtain the shortening pattern forzero padding as shown in above Table 1. As a result, when zero bits arepadded based on the shortening pattern as shown in above Table 1,excellent BER and FER performances may be obtained.

Meanwhile, according to an exemplary embodiment, the foregoinginformation bits may be implemented by L1-detail signaling. Therefore,the transmitter 100 may perform a shortening procedure for the L1-detailsignaling by using the foregoing method for transmission to the receiver200.

Here, the L1-detail signaling may be signaling defined in an AdvancedTelevision System Committee (ATSC) 3.0 standard.

In detail, The L1-detail signaling may be processed according to seven(7) different modes. The transmitter 100 according to the exemplaryembodiment may generate additional parity bits according to theforegoing method when an L1-detail mode 5 among the seven modesprocesses the L1-detail signaling.

The ATSC 3.0 standard defines L1-basic signaling besides the L1-detailsignaling. The transmitter 100 may process the L1-basic signaling andthe L1-detail signaling by using a specific scheme, and transmit theprocessed L1-basic signaling and the L1-detail signaling to the receiver200. In this case, the L1-basic signaling may also be processedaccording to seven different modes.

A method for processing the L1-basic signaling and the L1-detailsignaling will be described below.

The transmitter 100 may map the L1-basic signaling and the L1-detailsignaling to a preamble of a frame and map data to data symbols of theframe for transmission to the receiver 200.

Referring to FIG. 6, the frame may be configured of three parts, thatis, a bootstrap part, a preamble part, and a data part.

The bootstrap part is used for initial synchronization and provides abasic parameter required for the receiver 200 to decode the L1signaling. Further, the bootstrap part may include information about amode of processing the L1-basic signaling at the transmitter 100, thatis, information about a mode the transmitter 100 uses to process theL1-basic signaling.

The preamble part includes the L1 signaling, and may be configured oftwo parts, that is, the L1-basic signaling and the L1-detail signaling.

Here, the L1-basic signaling may include information about the L1-detailsignaling, and the L1-detail signaling may include information aboutdata. Here, the data is broadcasting data for providing broadcastingservices and may be transmitted through at least one physical layerpipes (PLPs).

In detail, the L1-basic signaling includes information required for thereceiver 200 to process the L1-detail signaling. This informationincludes, for example, information about a mode of processing theL1-detail signaling at the transmitter 100, that is, information about amode the transmitter 100 uses to process the L1-detail signaling,information about a length of the L1-detail signaling, information aboutan additional parity mode, that is, information about a K value used forthe transmitter 100 to generate additional parity bits using an L1B_L1Detail_additional_parity_mode (here, when theL1B_L1_Detail_additional_parity_mode is set as ‘00’, K=0 and theadditional parity bits are not used), and information about a length oftotal cells. Further, the L1-basic signaling may include basic signalinginformation about a system including the transmitter 100 such as a fastFourier transform (FFT) size, a guard interval, and a pilot pattern.

Further, the L1-detail signaling includes information required for thereceiver 200 to decode the PLPs, for example, start positions of cellsmapped to data symbols for each PLP, PLP identifier (ID), a size of thePLP, a modulation scheme, a code rate, etc.

Therefore, the receiver 200 may acquire frame synchronization, acquirethe L1-basic signaling and the L1-detail signaling from the preamble,and receive service data required by a user from data symbols using theL1-detail signaling.

The method for processing the L1-basic signaling and the L1-detailsignaling will be described below in more detail with reference to theaccompanying drawings.

FIGS. 7 and 8 are block diagrams for describing detailed configurationsof the transmitter 100, according to exemplary embodiments.

In detail, as illustrated in FIG. 7, to process the L1-basic signaling,the transmitter 100 may include a scrambler 211, a BCH encoder 212, azero padder 213, an LDPC encoder 214, a parity permutator 215, arepeater 216, a puncturer 217, a zero remover 219, a bit demultiplexer219, and a constellation mapper 221.

Further, as illustrated in FIG. 8, to process the L1-detail signaling,the transmitter 100 may include a segmenter 311, a scrambler 312, a BCHencoder 313, a zero padder 314, an LDPC encoder 315, a parity permutator316, a repeater 317, a puncturer 318, an additional parity generator319, a zero remover 321, bit demultiplexers 322 and 323, andconstellation mappers 324 and 325.

Here, the components illustrated in FIGS. 7 and 8 are components forperforming encoding and modulation on the L1-basic signaling and theL1-detail signaling, which is only one example. According to anotherexemplary embodiments, some of the components illustrated in FIGS. 7 and8 may be omitted or changed, and other components may also be added.Further, positions of some of the components may be changed. Forexample, the positions of the repeaters 216 and 317 may be disposedafter the puncturers 217 and 318, respectively.

The LDPC encoder 315, the repeater 317, the puncturer 318, and theadditional parity generator 319 illustrated in FIG. 10 may perform theoperations performed by the LDPC encoder 110, the repeater 120, thepuncturer 130, and the additional parity generator 140 illustrated inFIG. 1, respectively.

In describing FIGS. 9 and 10, for convenience, components for performingcommon functions will be described together.

The L1-basic signaling and the L1-detail signaling may be protected byconcatenation of a BCH outer code and an LDPC inner code. However, thisis only one example. Therefore, as outer encoding performed before innerencoding in the concatenated coding, another encoding such as CRCencoding in addition to the BCH encoding may be used. Further, theL1-basic signaling and the L1-detail signaling may be protected only bythe LDPC inner code without the outer code.

First, the L1-basic signaling and the L1-detail signaling may bescrambled. Further, the L1-basic signaling and the L1-detail signalingare BCH encoded, and thus, BCH parity check bits of the L1-basicsignaling and the L1-detail signaling generated from the BCH encodingmay be added to the L1-basic signaling and the L1-detail signaling,respectively. Further, the concatenated signaling and the BCH paritycheck bits may be additionally protected by a shortened and punctured16K LDPC code.

To provide various robustness levels appropriate for a wide signal tonoise ratio (SNR) range, a protection level of the L1-basic signalingand the L1-detail signaling may be divided into seven (7) modes. Thatis, the protection level of the L1-basic signaling and the L1-detailsignaling may be divided into the seven modes based on an LDPC code, amodulation order, shortening/puncturing parameters (that is, a ratio ofthe number of bits to be punctured to the number of bits to beshortened), and the number of bits to be basically punctured (that is,the number of bits to be basically punctured when the number of bits tobe shortened is 0). In each mode, at least one different combination ofthe LDPC code, the modulation order, the constellation, and theshortening/puncturing pattern may be used.

A mode for the transmitter 100 to processes the signaling may be set inadvance depending on a system. Therefore, the transmitter 100 maydetermine parameters (for example, modulation and code rate (ModCod) foreach mode, parameter for the BCH encoding, parameter for the zeropadding, shortening pattern, code rate/code length of the LDPC code,group-wise interleaving pattern, parameter for repetition, parameter forpuncturing, and modulation scheme, etc.) for processing the signalingdepending on the set mode, and may process the signaling based on thedetermined parameters and transmit the processed signaling to thereceiver 200. For this purpose, the transmitter 100 may pre-store theparameters for processing the signaling depending on the mode.

Modulation and code rate configurations (ModCod configurations) for theseven modes for processing the L1-basic signaling and the seven modesfor processing the L1-detail signaling are shown in following Table 5.The transmitter 100 may encode and modulate the signaling based on theModCod configurations defined in following Table 5 according to acorresponding mode. That is, the transmitter 100 may determine anencoding and modulation scheme for the signaling in each mode based onfollowing Table 5, and may encode and modulate the signaling accordingto the determined scheme. In this case, even when modulating the L1signaling by the same modulation scheme, the transmitter 100 may alsouse different constellations.

TABLE 5 Code Code Signaling FEC Type K_(sig) Length Rate ConstellationL1-Basic Mode 1 200 16200 3/15 QPSK Mode 2 (Type A) QPSK Mode 3 QPSKMode 4 NUC_16-QAM Mode 5 NUC_64-QAM Mode 6 NUC_256-QAM Mode 7NUC_256-QAM L1-Detail Mode 1 400~2352 QPSK Mode 2 400~3072 QPSK Mode 3400~6312 6/15 QPSK Mode 4 (Type B) NUC_16-QAM Mode 5 NUC_64-QAM Mode 6NUC_256-QAM Mode 7 NUC_256-QAM

In above Table 5, K_(sig) represents the number of information bits fora coded block. That is, since the L1 signaling bits having a length ofK_(sig) are encoded to generate the coded block, a length of the L1signaling in one coded block becomes K_(sig). Therefore, the L1signaling bits having the size of K_(sig) may be considered ascorresponding to one LDPC coded block.

Referring to above Table 5, the K_(sig) value for the L1-basic signalingis fixed to 200. However, since the amount of L1-detail signaling bitsvaries, the K_(sig) value for the L1-detail signaling varies.

In detail, in a case of the L1-detail signaling, the number of L1-detailsignaling bits varies, and thus, when the number of L1-detail signalingbits is greater than a preset value, the L1-detail signaling may besegmented to have a length which is equal to or less than the presetvalue.

In this case, each size of the segmented L1-detail signaling blocks(that is, segment of the L1-detail signaling) may have the K_(sig) valuedefined in above Table 5. Further, each of the segmented L1-detailsignaling blocks having the size of K_(sig) may correspond to one LDPCcoded block.

However, when the number of L1-detail signaling bits is equal to or lessthan the preset value, the L1-detail signaling is not segmented. In thiscase, the size of the L1-detail signaling may have the K_(sig) valuedefined in above Table 5. Further, the L1-detail signaling having thesize of K_(sig) may correspond to one LDPC coded block.

Hereinafter, a method for segmenting L1-detail signaling will bedescribed in detail.

The segmenter 311 segments the L1-detail signaling. In detail, since thelength of the L1-detail signaling varies, when the length of theL1-detail signaling is greater than the preset value, the segmenter 311may segment the L1-detail signaling to have the number of bits which areequal to or less than the preset value and output each of the segmentedL1-detail signalings to the scrambler 312.

However, when the length of the L1-detail signaling is equal to or lessthan the preset value, the segmenter 311 does not perform a separatesegmentation operation.

A method for segmenting, by the segmenter 311, the L1-detail signalingis as follows.

The amount of L1-detail signaling bits varies and mainly depends on thenumber of PLPs. Therefore, to transmit all bits of the L1-detailsignaling, at least one forward error correction (FEC) frame isrequired. Here, an FEC frame may represent a form in which the L1-detailsignaling is encoded, and thus, parity bits according to the encodingare added to the L1-detail signaling.

In detail, when the L1-detail signaling is not segmented, the L1-detailsignaling is BCH-encoded and LDPC encoded to generate one FEC frame, andtherefore, one FEC frame is required for the L1-detail signalingtransmission. However, when the L1-detail signaling is segmented into atleast two, these segmented L1-detail signalings each are BCH-encoded andLDPC-encoded to generate at least two FEC frames, and therefore, atleast two FEC frames are required for the L1-detail signalingtransmission.

Therefore, the segmenter 311 may calculate the number N_(L1D) _(_)_(FECFRAME) of FEC frames for the L1-detail signaling based on followingEquation 12. That is, the number N_(L1D) _(_) _(FECFRAME) of FEC framesfor the L1-detail signaling may be determined based on followingEquation 12.

$\begin{matrix}{N_{L\; 1{D\_ {FECFRAME}}} = \left\lceil \frac{K_{L\; 1{D\_ {ex}}{\_ {pad}}}}{K_{seg}} \right\rceil} & (12)\end{matrix}$

In above Equation 12, ┌x┐ represents a minimum integer which is equal toor greater than x.

Further, in above Equation 12, K_(L1D) _(_) _(ex) _(_) _(pad) representsthe length of the L1-detail signaling except L1 padding bits asillustrated in FIG. 9, and may be determined by a value of anL1B_L1_Detail_size_bits field included in the L1-basic signaling.

Further, K_(seg) represents a threshold number for segmentation definedbased on the number K_(ldpc) of information bits input to the LDPCencoder 315, that is, the LDPC information bits. Further, K_(seg) may bedefined based on the number of BCH parity check bits of BCH encoding anda multiple value of 360.

K_(seg) is determined such that, after the L1-detail signaling issegmented, the number K_(sig) of information bits in the coded block isset to be equal to or less than K_(ldpc)−M_(outer). In detail, when theL1-detail signaling is segmented based on K_(seg), since the length ofsegmented L1-detail signaling does not exceed K_(seg), the length of thesegmented L1-detail signaling is set to be equal to or less thanK_(ldpc)−M_(outer) when K_(seg) is set like in Table 6 as following.

Here, M_(outer) and K_(ldpc) are as following Tables 7 and 8. Forsufficient robustness, the K_(seg) value for the L1-detail signalingmode 1 may be set to be K_(ldpc)−M_(outer)−720.

K_(seg) for each mode of the L1-detail signaling may be defined asfollowing Table 6. In this case, the segmenter 311 may determine K_(seg)according to a corresponding mode as shown in following Table 6.

TABLE 6 L1-Detail K_(seg) Mode 1 2352 Mode 2 3072 Mode 3 6312 Mode 4Mode 5 Mode 6 Mode 7

As illustrated in FIG. 9, an entire L1-detail signaling may be formed ofL1-detail signaling and L1 padding bits.

In this case, the segmenter 311 may calculate a length of an L1_PADDINGfield for the L1-detail signaling, that is, the number _(L1D) _(_)_(PAD) of the L1 padding bits based on following Equation 13. However,calculating K_(L1D) _(_) _(PAD) based on following Equation 13 is onlyone example. That is, the segmenter 311 may calculate the length of theL1_PADDING field for the L1-detail signaling, that is, the numberK_(L1D) _(_) _(PAD) of the L1 padding bits based on K_(L1D) _(_) _(ex)_(_) _(pad) and N_(L1D) _(_) _(FECFRAME) values. As one example, theK_(L1D) _(_) _(PAD) value may be obtained based on following Equation13. That is, following Equation 18 is only one example of a method forobtaining a K_(L1D) _(_) _(PAD) value, and thus, another method based onthe K_(L1D) _(_) _(ex) _(_) _(pad) and N_(L1D) _(_) _(FECFRAME) valuesmay be applied to obtain an equivalent result.

$\begin{matrix}{K_{L\; 1{D\_ {PAD}}} = {\left\lceil \frac{K_{L\; 1{D\_ {ex}}{\_ {pad}}}}{N_{L\; 1{D\_ {FECFRAME}}}} \right\rceil \times {N_{L\; 1{D\_ {FECFRAME}}} \cdot K_{L\; 1{D\_ {ex}}{\_ {pad}}}}}} & (13)\end{matrix}$

Further, the segmenter 311 may fill the L1 PADDING field with K_(L1D)_(_) _(PAD) zero bits (that is, bits having a 0 value). Therefore, asillustrated in FIG. 11, the K_(L1D) _(_) _(PAD) zero bits may be filledin the L1_PADDING field.

As such, by calculating the length of the L1_PADDING field and paddingzero bits of the calculated length to the L1_PADDING field, theL1-detail signaling may be segmented into the plurality of blocks formedof the same number of bits when the L1-detail signaling is segmented.

Next, the segmenter 311 may calculate a final length K_(L1D) of theentire L1-detail signaling including the zero padding bits based onfollowing Equation 14.

K _(L1D) =K _(L1D) _(_) _(ex) _(pad) +K _(L1D) _(PAD)    (14)

Further, the segmenter 311 may calculate the number K_(sig) ofinformation bits in each of the N_(L1D) _(_) _(FECFRAME) blocks based onfollowing Equation 15.

$\begin{matrix}{K_{sig} = \frac{K_{L\; 1D}}{N_{L\; 1{D\_ {FECFRAME}}}}} & (15)\end{matrix}$

Next, the segmenter 311 may segment the L1-detail signaling by K_(sig)number of bits.

In detail, as illustrated in FIG. 9, when N_(L1D) _(_) _(FECFRAME) isgreater than 1, the segmenter 311 may segment the L1-detail signaling bythe number of K_(sig) bits to segment the L1-detail signaling into theN_(L1D) _(_) _(FECFRAME) blocks.

Therefore, the L1-detail signaling may be segmented into N_(L1D) _(_)_(FECFRAME) blocks, and the number of L1-detail signaling bits in eachof the N_(L1D) _(_) _(FECFRAME) blocks may be K_(sig). Further, eachsegmented L1-detail signaling is encoded. As an encoded result, a codedblock, that is, an FEC frame is formed, such that the number ofL1-detail signaling bits in each of the N_(L1D) _(_) _(FECFRAME) codedblocks may be K_(sig).

However, when the L1-detail signaling is not segmented, K_(sig)=K_(L1D)_(_) _(ex) _(_) _(pad).

The segmented L1-detail signaling blocks may be encoded by a followingprocedure.

In detail, all bits of each of the L1-detail signaling blocks having thesize K_(sig) may be scrambled. Next, each of the scrambled L1-detailsignaling blocks may be encoded by concatenation of the BCH outer codeand the LDPC inner code.

In detail, each of the L1-detail signaling blocks is BCH-encoded, andthus M_(outer) (=168) BCH parity check bits may be added to the K_(sig)L1-detail signaling bits of each block, and then, the concatenation ofthe L1-detail signaling bits and the BCH parity check bits of each blockmay be encoded by a shortened and punctured 16K LDPC code. The detailsof the BCH code and the LDPC code will be described below. However, theexemplary embodiments describe only a case in which M_(outer)=168, butit is apparent that M_(outer) may be changed into an appropriate valuedepending on the requirements of a system.

The scramblers 211 and 312 scramble the L1-basic signaling and theL1-detail signaling, respectively. In detail, the scramblers 211 and 312may randomize the L1-basic signaling and the L1-detail signaling, andoutput the randomized L1-basic signaling and L1-detail signaling to theBCH encoders 212 and 313, respectively.

In this case, the scramblers 211 and 312 may scramble the informationbits by a unit of K_(sig).

That is, since the number of L1-basic signaling bits transmitted to thereceiver 200 through each frame is 200, the scrambler 211 may scramblethe L1-basic signaling bits by K_(sig) (=200).

Since the number of L1-basic signaling bits transmitted to the receiver200 through each frame varies, in some cases, the L1-detail signalingmay be segmented by the segmenter 311. Further, the segmenter 311 mayoutput the L1-detail signaling formed of K_(sig) bits or the segmentedL1-detail signaling blocks to the scrambler 312. As a result, thescrambler 312 may scramble the L1-detail signaling bits by every K_(sig)which are output from the segmenter 311.

The BCH encoders 212 and 313 perform the BCH encoding on the L1-basicsignaling and the L1-detail signaling to generate the BCH parity checkbits.

In detail, the BCH encoders 212 and 313 may perform the BCH encoding onthe L1-basic signaling and the L1-detail signaling output from thescramblers 211 and 313, respectively, to generate the BCH parity checkbits, and output the BCH-encoded bits in which the BCH parity check bitsare added to each of the L1-basic signaling and the L1-detail signalingto the zero padders 213 and 314, respectively.

For example, the BCH encoders 212 and 313 may perform the BCH encodingon the input K_(sig) bits to generate the M_(outer) (that is,K_(sig)=K_(payload)) BCH parity check bits and output the BCH-encodedbits formed of N_(outer) (=K_(sig)+M_(outer)) bits to the zero padders213 and 314, respectively.

The parameters for the BCH encoding may be defined as following Table 7.

TABLE 7 K_(sig) = N_(outer) = Signaling FEC Type K_(payload) M_(outer)K_(sig) + M_(outer) L1-Basic Mode 1 200 168 368 Mode 2 Mode 3 Mode 4Mode 5 Mode 6 Mode 7 L1-Detail Mode 1 400~2352 568~2520 Mode 2 400~3072568~3240 Mode 3 400~6312 568~6480 Mode 4 Mode 5 Mode 6 Mode 7

Meanwhile, referring to FIGS. 7 and 8, it may be appreciated that theLDPC encoders 214 and 315 may be disposed after the BCH encoders 212 and313, respectively.

Therefore, the L1-basic signaling and the L1-detail signaling may beprotected by the concatenation of the BCH outer code and the LDPC innercode.

In detail, the L1-basic signaling and the L1-detail signaling areBCH-encoded, and thus, the BCH parity check bits for the L1-basicsignaling are added to the L1-basic signaling and the BCH parity checkbits for the L1-detail signaling are added to the L1-detail signaling.Further, the concatenated L1-basic signaling and BCH parity check bitsare additionally protected by an LDPC code, and the concatenatedL1-detail signaling and BCH parity check bits may be additionallyprotected by an LDPC code.

Here, it is assumed that an LDPC code for LDPC encoding is a 16K LDPCcode, and thus, in the BCH encoders 212 and 213, a systematic BCH codefor N_(inner)=16200 (that is, the code length of the 16K LDPC code is16200 and an LDPC codeword generated by the LDPC encoding may be formedof 16200 bits) may be used to perform outer encoding of the L1-basicsignaling and the L1-detail signaling.

The zero padders 213 and 314 pad zero bits. In detail, for the LDPCcode, a predetermined number of LDPC information bits defined accordingto a code rate and a code length is required, and thus, the zero padders213 and 314 may pad zero bits for the LDPC encoding to generate thepredetermined number of LDPC information bits formed of the BCH-encodedbits and zero bits, and output the generated bits to the LDPC encoders214 and 315, respectively, when the number of BCH-encoded bits is lessthan the number of LDPC information bits. When the number of BCH-encodedbits is equal to the number of LDPC information bits, zero bits are notpadded.

Here, zero bits padded by the zero padders 213 and 314 are padded forthe LDPC encoding, and therefore, the padded zero bits padded are nottransmitted to the receiver 200 by a shortening operation.

For example, when the number of LDPC information bits of the 16K LDPCcode is K_(ldpc), in order to form K_(ldpc) LDPC information bits, zerobits are padded to some of the LDPC information bits.

In detail, when the number of BCH-encoded bits is N_(outer), the numberof LDPC information bits of the 16K LDPC code is K_(ldpc), andN_(outer)<K_(ldpc), the zero padders 213 and 314 may pad theK_(ldpc)−N_(outer) zero bits to some of the LDPC information bits, anduse the N_(outer) BCH-encoded bits as the remaining portion of the LDPCinformation bits to generate the LDPC information bits formed ofK_(ldpc) bits. However, when N_(outer)=K_(ldpc), zero bits are notpadded.

For this purpose, the zero padders 213 and 314 may divide the LDPCinformation bits into a plurality of bit groups.

For example, the zero padders 213 and 314 may divide the K_(ldpc) LDPCinformation bits (i₀, i₁, . . . , i_(K) _(ldpc) ⁻¹) into N_(info) _(_)_(group)(=K_(ldpc)/360) bit groups based on following Equation 16 or 17.That is, the zero padders 213 and 314 may divide the LDPC informationbits into the plurality of bit groups so that the number of bitsincluded in each bit group is 360.

$\begin{matrix}{z_{j} = {{\left\{ {{\left. i_{k} \middle| j \right. = \left\lfloor \frac{k}{360} \right\rfloor},{0 \leq k < K_{ldpc}}} \right\} \mspace{14mu} {for}\mspace{14mu} 0} \leq j < N_{{info}\_ {group}}}} & (16) \\{z_{j} = {{\left\{ i_{x} \middle| {{360 \times j} \leq k < {360 \times \left( {j + 1} \right)}} \right\} \mspace{14mu} {for}\mspace{14mu} 0} \leq j < N_{{info}\_ {group}}}} & (17)\end{matrix}$

In above Equations 16 and 17, Z_(j) represents a j-th bit group.

The parameters N_(outer), K_(ldpc), and N_(info) _(_) _(group) for thezero padding for the L1-basic signaling and the L1-detail signaling maybe defined as shown in following Table 8. In this case, the zero padders213 and 314 may determine parameters for the zero padding according to acorresponding mode as shown in following Table 8.

TABLE 8 Signaling FEC Type N_(outer) K_(ldpc) N_(info) _(—) _(group)L1-Basic (all modes) 368 3240 9 L1-Detail Mode 1 568~2620 L1-Datail Mode2 568~3240 L1-Detail Mode 3 568~6480 6480 18 L1-Detail Mode 4 L1-DetailMode 5 L1-Detail Mode 6 L1-Detail Mode 7

Further, for 0≦j<N_(info) _(_) _(group), each bit group Z_(j) as shownin FIG. 12 may be formed of 360 bits.

In detail, FIG. 10 illustrates a data format after the L1-basicsignaling and the L1-detail signaling each are LDPC-encoded. In FIG. 10,an LDPC FEC added to the K_(ldpc) LDPC information bits represents theLDPC parity bits generated by the LDPC encoding.

Referring to FIG. 10, the K_(ldpc) LDPC information bits are dividedinto the N_(info) _(_) _(group) bits groups and each bit group may beformed of 360 bits.

When the number N_(outer)(=K_(sig)+M_(outer)) of BCH-encoded bits forthe L1-basic signaling and the L1-detail signaling is less than theK_(ldpc), that is, N_(outer)(=K_(sig)+M_(outer))<K_(ldpc), for the LDPCencoding, the K_(ldpc) LDPC information bits may be filled with theN_(outer) BCH-encoded bits and the K_(ldpc)−N_(outer) zero-padded bits.In this case, the padded zero bits are not transmitted to the receiver200.

Hereinafter, a shortening procedure performed by the zero padders 213and 314 will be described in more detail.

The zero padders 213 and 314 may calculate the number of padded zerobits. That is, to fit the number of bits required for the LDPC encoding,the zero padders 213 and 314 may calculate the number of zero bits to bepadded.

In detail, the zero padders 213 and 314 may calculate a differencebetween the number of LDPC information bits and the number ofBCH-encoded bits as the number of padded zero bits. That is, for a givenN_(outer), the zero padders 213 and 314 may calculate the number ofpadded zero bits as K_(ldpc)−N_(outer).

Further, the zero padders 213 and 314 may calculate the number of bitgroups in which all the bits are padded. That is, the zero padders 213and 314 may calculate the number of bit groups in which all bits withinthe bit group are padded by zero bits.

In detail, the zero padders 213 and 314 may calculate the number N_(pad)of groups to which all bits are padded based on following Equation 18 or19.

$\begin{matrix}{N_{pad} = \left\lfloor \frac{K_{ldpc} - N_{outer}}{360} \right\rfloor} & (18) \\{N_{pad} = \left\lfloor \frac{\left( {K_{ldpc} - M_{outer}} \right) - K_{sig}}{360} \right\rfloor} & (19)\end{matrix}$

Next, the zero padders 213 and 314 may determine bit groups in whichzero bits are padded among a plurality of bit groups based on ashortening pattern, and may pad zero bits to all bits within some of thedetermined bit groups and some bits within the remaining bit groups.

In this case, the shortening pattern of the padded bit group may bedefined as shown in following Table 9. In this case, the zero padders213 and 314 may determine the shortening patterns according to acorresponding mode as shown in following Table 9.

TABLE 9 π_(S)(j) (0 ≦ j < N_(info) _(—) _(group)) Signaling FEC π_(S)(0)π_(S)(1) π_(S)(2) π_(S)(3) π_(S)(4) π_(S)(5) π_(S)(6) π_(S)(7) π_(S)(8)Type N_(info) _(—) _(group) π_(S)(9) π_(S)(10) π_(S)(11) π_(S)(12)π_(S)(13) π_(S)(14) π_(S)(15) π_(S)(16) π_(S)(17) L1-Basic 9 4 1 5 2 8 60 7 3 (for all modes) — — — — — — — — — L1-Detail Mode 1 7 8 5 4 1 2 6 30 — — — — — — — — — L1-Detail Mode 2 6 1 7 8 0 2 4 3 5 — — — — — — — — —L1-Detail Mode 3 18 0 12 15 13 2 5 7 9 8 6 16 10 14 1 17 11 4 3L1-Detail Mode 4 0 15 5 16 17 1 6 13 11 4 7 12 8 14 2 3 9 10 L1-DetailMode 5 2 4 5 17 9 7 1 6 15 8 10 14 16 0 11 13 12 3 L1-Detail Mode 6 0 155 16 17 1 6 13 11 4 7 12 8 14 2 3 9 10 L1-Detail Mode 7 15  7 8 11 5 1016 4 12 3 0 6 9 1 14 17 2 13

Here, π_(s)(j) is an index of a j-th padded bit group. That is, theπ_(s)(j) represents a shortening pattern order of the j-th bit group.Further, N_(info) _(_) _(group) is the number of bit groups configuringthe LDPC information bits.

In detail, the zero padders 213 and 314 may determine Z_(π) _(s) ₍₀₎,Z_(π) _(s) ₍₁₎, . . . , Z_(π) _(s) _((N) _(pad) ⁻¹⁾ as bit groups inwhich all bits within the bit group are padded by zero bits based on theshortening pattern, and pad zero bits to all bits of the bit groups.That is, the zero padders 213 and 314 may pad zero bits to all bits of aπ_(s)(0)-th bit group, a π_(s)(1)-th bit group, . . . aπ_(s)(N_(pad)−1)-th bit group among the plurality of bit groups based onthe shortening pattern.

As such, when N_(pad) is not 0, the zero padders 213 and 314 maydetermine a list of the N_(pad) bit groups, that is, Z_(π) _(s) ₍₀₎,Z_(π) _(s) ₍₁₎, . . . , Z_(π) _(s) _((N) _(pad) ⁻¹⁾ based on above Table9, and pad zero bits to all bits within the determined bit group.

However, when the N_(pad) is 0, the foregoing procedure may be omitted.

Since the number of all the padded zero bits is K_(ldpc)−N_(outer) andthe number of zero bits padded to the N_(pad) bit groups is 360×N_(pad),the zero padders 213 and 314 may additionally pad zero bits toK_(ldpc)−N_(out)−360×N_(pad) LDPC information bits.

In this case, the zero padders 213 and 314 may determine a bit group towhich zero bits are additionally padded based on the shortening pattern,and may additionally pad zero bits from a head portion of the determinedbit group.

In detail, the zero padders 213 and 314 may determine Z_(π) _(s) _((N)_(pad) ₎ as a bit group to which zero bits are additionally padded basedon the shortening pattern, and may additionally pad zero bits to theK_(ldpc)−N_(out)−360×N_(pad) bits positioned at the head portion ofZ_(π) _(s) _((N) _(pad) ₎. Therefore, the K_(ldpc)−N_(outer)−360×N_(pad)zero bits may be padded from a first bit of the π_(s)(N_(pad))-th bitgroup.

As a result, for Z_(π) _(s) _((N) _(pad) ₎, zero bits may beadditionally padded to the K_(ldpc)−N_(bch)−360×N_(pad) bits positionedat the head portion of the Z_(π) _(s) _((N) _(pad) ₎.

The foregoing example describes that K_(ldpc)−N_(outer)−360×N_(pad) zerobits are padded from a first bit of the Z_(π) _(s) _((N) _(pad) ₎, whichis only one example. Therefore, the position at which zero bits arepadded in the Z_(π) _(s) _((N) _(pad) ₎ may be changed. For example, theK_(ldpc)−N_(outer)+−360×N_(pad) zero bits may be padded to a middleportion or a last portion of the Z_(π) _(s) _((N) _(pad) ₎ or may alsobe padded at any position of the Z_(π) _(s) _((N) _(pad) ₎.

Next, the zero padders 213 and 314 may map the BCH-encoded bits to thepositions at which zero bits are not padded to configure the LDPCinformation bits.

Therefore, the N_(outer) BCH-encoded bits are sequentially mapped to thebit positions at which zero bits in the K_(ldpc) LDPC information bits(i₀, i₁, . . . , i_(K) _(ldpc) ⁻¹) are not padded, and thus, theK_(ldpc) LDPC information bits may be formed of the N_(outer)BCH-encoded bits and the K_(ldpc)−N_(outer) information bits.

The padded zero bits are not transmitted to the receiver 200. As such, aprocedure of padding the zero bits or a procedure of padding the zerobits and then not transmitting the padded zero bits to the receiver 200may be called shortening.

The LDPC encoders 214 and 315 perform LDPC encoding on the L1-basicsignaling and the L1-detail signaling, respectively.

In detail, the LDPC encoders 214 and 315 may perform LDPC encoding onthe LDPC information bits output from the zero padders 213 and 31 togenerate LDPC parity bits, and output an LDPC codeword including theLDPC information bits and the LDPC parity bits to the parity permutators215 and 316, respectively.

That is, K_(ldpc) bits output from the zero padder 213 may includeK_(sig) L1-basic signaling bits, M_(outer) (=N_(outer)−K_(sig)) BCHparity check bits, and K_(ldpc)−N_(outer) padded zero bits, which mayconfigure K_(ldpc) LDPC information bits i=(i₀, i₁, . . . , i_(K)_(ldpc) ⁻¹) for the LDPC encoder 214.

Further, the K_(ldpc) bits output from the zero padder 314 may includethe K_(sig) L1 detail signaling bits, the M_(outer) (N_(outer)−K_(sig))BCH parity check bits, and the (K_(ldpc)−N_(outer)) padded zero bits,which may configure the K_(ldpc) LDPC information bits i=(i₀, i₁, . . ., i_(K) _(ldpc) ⁻¹) for the LDPC encoder 315.

In this case, the LDPC encoders 214 and 315 may systematically performthe LDPC encoding on the K_(ldpc) LDPC information bits to generate anLDPC codeword Λ=(c₀, c₁, . . . , c_(N) _(inner) ⁻¹)=(i₀, i₁, . . . i_(K)_(ldpc) ⁻¹, p₀, p₁, . . . , p_(N) _(inner) _(−K) _(ldpc) ⁻¹) formed ofN_(inner) bits.

In the L1-basic modes and the L1-detail modes 1 and 2, the LDPC encoders214 and 315 may encode the L1-basic signaling and the L1-detailsignaling at a code rate of 3/15 to generate 16200 LDPC codeword bits.In this case, the LDPC encoders 214 and 315 may perform the LDPCencoding based on above Table 2.

Further, in the L1-detail modes 3, 4, 5 6, and 7, the LDPC encoder 315may encode the L1-detail signaling at a code rate of 6/15 to generatethe 16200 LDPC codeword bits. In this case, the LDPC encoder 315 mayperform the LDPC encoding based on above Table 4.

The code rate and the code length for the L1-basic signaling and theL1-detail signaling are as shown in above Table 5, and the number ofLDPC information bits are as shown in above Table 8.

The parity permutators 215 and 316 perform parity permutation. That is,the parity permutators 215 and 316 may perform permutation only on theLDPC parity bits among the LDPC information bits and the LDPC paritybits.

In detail, the parity permutators 215 and 316 may perform thepermutation only on the LDPC parity bits in the LDPC codewords outputfrom the LDPC encoders 214 and 315, and output the parity permutatedLDPC codewords to the repeaters 216 and 317, respectively. The paritypermutator 316 may output the parity permutated LDPC codeword to anadditional parity generator 319. In this case, the additional paritygenerator 319 may use the parity permutated LDPC codeword output fromthe parity permutator 316 to generate additional parity bits.

For this purpose, the parity permutators 215 and 316 may include aparity interleaver (not illustrated) and a group-wise interleaver (notillustrated).

First, the parity interleaver may interleave only the LDPC parity bitsamong the LDPC information bits and the LDPC parity bits configuring theLDPC codeword. However, the parity interleaver may perform the parityinterleaving only in the cases of the L1-detail modes 3, 4, 5 6, and 7.That is, since the L1-basic modes and the L1-detail modes 1 and 2include the parity interleaving as a portion of the LDPC encodingprocess, in the L1-basic modes and the L1-detail modes 1 and 2, theparity interleaver may not perform the parity interleaving.

In the mode of performing the parity interleaving, the parityinterleaver may interleave the LDPC parity bits based on followingEquation 20.

u _(i) =c _(i) for 0≦i<K _(ldpc) (information bits are not interleaved.)

u _(K) _(ldpc) _(+360t+s) =c _(K) _(ldpc) _(°27s+t) for 0≦s<360,0≦t<27   (20)

In detail, based on above Equation 20, the LDPC codeword (c₀, c₁, . . ., c_(N) _(inner) ⁻¹) is parity-interleaved by the parity interleaver andan output of the parity interleaver may be represented by U=(u₀, u₁, . .. , u_(N) _(inner) ⁻¹).

Since the L1-basic modes and the L1-detail modes 1 and 2 do not use theparity interleaver, an output U=(u₀, u₁, . . . , u_(N) _(inner) ⁻¹) ofthe parity interleaver may be represented as following Equation 21.

u _(i) =c _(i) for 0≦i<N _(inn)   (21)

The group-wise interleaver may perform the group-wise interleaving onthe output of the parity interleaver.

Here, as described above, the output of the parity interleaver may be anLDPC codeword parity-interleaved by the parity interleaver or may be anLDPC codeword which is not parity-interleaved by the parity interleaver.

Therefore, when the parity interleaving is performed, the group-wiseinterleaver may perform the group-wise interleaving on the parityinterleaved LDPC codeword, and when the parity interleaving is notperformed, the group-wise interleaver may perform the group-wiseinterleaving on the LDPC codeword which is not parity-interleaved.

In detail, the group-wise interleaver may interleave the output of theparity interleaver in a bit group unit.

For this purpose, the group-wise interleaver may divide an LDPC codewordoutput from the parity interleaver into a plurality of bit groups. As aresult, the LDPC parity bits output from the parity interleaver may bedivided into a plurality of bit groups.

In detail, the group-wise interleaver may divide the LDPC-encoded bits(u₀, u₁, . . . , u_(N) _(inner) ⁻¹) output from the parity interleaverinto N_(group)(=N_(inner)/360) bit groups based on following Equation22.

X _(j) ={u _(k)|360×j≦k<360×(j+1),0≦k<N _(inner)} for 0≦j<N _(group)  (22)

In above Equation 22, X_(j) represents a j-th bit group.

FIG. 11 illustrates an example of dividing the LDPC codeword output fromthe parity interleaver into a plurality of bit groups.

Referring to FIG. 11, the LDPC codeword is divided intoN_(group)(=N_(inner)/360) bit groups, and each bit group X_(j) for0≦j<N_(group) is formed of 360 bits.

As a result, the LDPC information bits formed of K_(ldpc) bits may bedivided into K_(ldpc)/360 bit groups and the LDPC parity bits formed ofN_(inner)−K_(ldpc) bits may be divided into N_(inner)−K_(ldpc)/360 bitgroups.

Further, the group-wise interleaver performs the group-wise interleavingon the LDPC codeword output from the parity interleaver.

In this case, the group-wise interleaver does not perform interleavingon the LDPC information bits, and may perform the interleaving only onthe LDPC parity bits to change the order of the plurality of bit groupsconfiguring the LDPC parity bits.

As a result, the LDPC information bits among the LDPC bits may not beinterleaved by the group-wise interleaver but the LDPC parity bits amongthe LDPC bits may be interleaved by the group-wise interleaver. In thiscase, the LDPC parity bits may be interleaved in a group unit.

In detail, the group-wise interleaver may perform the group-wiseinterleaving on the LDPC codeword output from the parity interleaverbased on following Equation 23.

Y _(j) =X _(j), 0≦j<K _(ldpc)/360

Y _(j) =X _(πp(j)) , K _(ldpc)/360≦j<N _(group)   (23)

Here, Y_(j) represents a group-wise interleaved j-th bit group, X_(j)represents a j-th bit group among the plurality of bit groupsconfiguring the LDPC codeword, that is, the j-th bit group prior to thegroup-wise interleaving. Further, π_(p)(j) represents a permutationorder for the group-wise interleaving.

The permutation order may be defined based on following Table 10 andTable 11. Here, Table 10 shows a group-wise interleaving pattern of aparity portion in the L1-basic modes and the L1-detail modes 1 and 2,and Table 11 shows a group-wise interleaving pattern of a parity portionfor the L1-detail modes 3, 4, 5 6, and 7.

In this case, the group-wise interleaver may determine the group-wiseinterleaving pattern according to a corresponding mode shown infollowing Tables 10 and 11.

TABLE 10 Order of group-wise interleaving π_(p)(j) (9 ≦ j < 45) π_(p)(9)π_(p)(10) π_(p)(11) π_(p)(12) π_(p)(13) π_(p)(14) π_(p)(15) π_(p)(16)π_(p)(17) π_(p)(18) π_(p)(19) π_(p)(20) Signaling π_(p)(21) π_(p)(22)π_(p)(23) π_(p)(24) π_(p)(25) π_(p)(26) π_(p)(27) π_(p)(28) π_(p)(29)π_(p)(30) π_(p)(31) π_(p)(32) FEC Type N_(group) π_(p)(33) π_(p)(34)π_(p)(35) π_(p)(36) π_(p)(37) π_(p)(38) π_(p)(39) π_(p)(40) π_(p)(41)π_(p)(42) π_(p)(43) π_(p)(44) L1-Basic 45 20 23 25 32 38 41 18 9 10 1131 24 (all modes) 14 15 26 40 33 19 28 34 16 39 27 30 21 44 43 35 42 3612 13 29 22 37 17 L1-Detail 16 22 27 30 37 44 20 23 25 32 38 41 Mode 1 910 17 18 21 33 35 14 28 12 15 19 11 24 29 34 36 13 40 43 31 26 39 42L1-Detail 9 31 23 10 11 25 43 29 36 16 27 34 Mode 2 26 18 37 15 13 17 3521 20 24 44 12 22 40 19 32 38 41 30 33 14 28 39 42

TABLE 11 Sig- nal- Order of group-wise interleaving ing π_(p)(j) (18 ≦ j< 45) FEC π_(p)(18) π_(p)(19) π_(p)(20) π_(p)(21) π_(p)(22) π_(p)(23)π_(p)(24) π_(p)(25) π_(p)(26) π_(p)(27) π_(p)(28) π_(p)(29) π_(p)(30)Type N_(group) π_(p)(32) π_(p)(33) π_(p)(34) π_(p)(35) π_(p)(36)π_(p)(37) π_(p)(38) π_(p)(39) π_(p)(40) π_(p)(41) π_(p)(42) π_(p)(43)π_(p)(44) π_(p)(31) L1- 45 19 37 30 42 23 44 27 40 21 34 25 32 29 24 De-26 35 39 20 18 43 31 36 38 22 33 28 41 tail Mode 3 L1- 20 35 42 39 26 2330 18 28 37 32 27 44 43 De- 41 40 38 36 34 33 31 29 25 24 22 21 19 tailMode 4 L1- 19 37 33 26 40 43 22 29 24 35 44 31 27 20 De- 21 39 25 42 3418 32 38 23 30 28 36 41 tail Mode 5 L1- 20 35 42 39 26 23 30 18 28 37 3227 44 43 De- 41 40 38 36 34 33 31 29 25 24 22 21 19 tail Mode 6 L1- 4423 29 33 24 28 21 27 42 18 22 31 32 37 De- 43 30 25 35 20 34 39 36 19 4140 26 38 tail Mode 7

Hereinafter, for the group-wise interleaving pattern in the L1-detailmode 2 as an example, an operation of the group-wise interleaver will bedescribed.

In the L1-detail mode 2, the LDPC encoder 315 performs LDPC encoding on3240 LDPC information bits at a code rate of 3/15 to generate 12960 LDPCparity bits. In this case, an LDPC codeword may be formed of 16200 bits.

Each bit group is formed of 360 bits, and as a result the LDPC codewordformed of 16200 bits is divided into 45 bit groups.

Here, since the number of the LDPC information bits is 3240 and thenumber of the LDPC parity bits is 12960, a 0-th bit group to an 8-th bitgroup correspond to the LDPC information bits and a 9-th bit group to a44-th bit group correspond to the LDPC parity bits.

In this case, the group-wise interleaver does not perform interleavingon the bit groups configuring the LDPC information bits, that is, a 0-thbit group to a 8-th bit group based on above Equation 28 and Table 10,but may interleave the bit groups configuring the LDPC parity bits, thatis, a 9-th bit group to a 44-th bit group in a group unit to change anorder of the 9-th bit group to the 44-th bit group.

In detail, in the L1-detail mode 2 in above Table 10, above Equation 28may be represented like Y₀=X₀, Y₁=X₁, . . . , Y₇=X₇, Y₈=X₈,Y₉=X_(πp(p))=X₉, Y₁₀=X_(πp(10))=X₃₁, Y₁₁=X_(πp(11))=X₂₃, . . . ,Y₄₂=X_(πp(42))=X₂₈, Y₄₃=X_(πp(43))=X₃₉, Y₄₄=X_(πp(44))=X₄₂.

Therefore, the group-wise interleaver does not change an order of the0-th bit group to the 8-th bit group including the LDPC information bitsbut may change an order of the 9-th bit group to the 44-th bit groupincluding the LDPC parity bits.

In detail, the group-wise interleaver may change the order of the bitgroups from the 9-th bit group to the 44-th bit group so that the 9-thbit group is positioned at the 9-th position, the 31-th bit group ispositioned at the 10-th position, the 23-th bit group is positioned atthe 11-th position, . . . , the 28-th bit group is positioned at the42-th position, the 39-th bit group is positioned at the 43-th position,the 42-th bit group is positioned at the 44-th position.

As described below, since the puncturers 217 and 318 perform puncturingfrom the last parity bit, the parity bit groups may be arranged in aninverse order of the puncturing pattern by the parity permutation. Thatis, the first bit group to be punctured is positioned at the last bitgroup.

The foregoing example describes that only the parity bits areinterleaved, which is only one example. That is, the parity permutators215 and 316 may also interleave the LDPC information bits. In this case,the parity permutators 215 and 316 may interleave the LDPC informationbits with identity and output the LDPC information bits having the sameorder before the interleaving so that the order of the LDPC informationbits is not changed.

The repeaters 216 and 317 may repeat at least some bits of the paritypermutated LDPC codeword at a position subsequent to the LDPCinformation bits, and output the repeated LDPC codeword, that is, theLDPC codeword bits including the repetition bits, to the puncturers 217and 318. The repeater 317 may also output the repeated LDPC codeword tothe additional parity generator 319. In this case, the additional paritygenerator 319 may use the repeated LDPC codeword to generate theadditional parity bits.

In detail, the repeaters 216 and 317 may repeat a predetermined numberof LDPC parity bits after the LDPC information bits. That is, therepeaters 216 and 317 may add the predetermined number of repeated LDPCparity bits after the LDPC information bits. Therefore, the repeatedLDPC parity bits are positioned between the LDPC information bits andthe LDPC parity bits within the LDPC codeword.

Therefore, since the predetermined number of bits within the LDPCcodeword after the repetition may be repeated and additionallytransmitted to the receiver 200, the foregoing operation may be referredto as repetition.

The term “adding” represents disposing the repetition bits between theLDPC information bits and the LDPC parity bits so that the bits arerepeated.

The repetition may be performed only on the L1-basic mode 1 and theL1-detail mode 1, and may not be performed on the other modes. In thiscase, the repeaters 216 and 317 do not perform the repetition and mayoutput the parity permutated LDPC codeword to the puncturers 217 and318.

Hereinafter, a method for performing repetition will be described inmore detail.

The repeaters 216 and 317 may calculate a number N_(repeat) of bitsadditionally transmitted per an LDPC codeword based on followingEquation 24.

N _(repeat)=2×└C×N _(outer) ┘+D   (24)

In above Equation 24, C has a fixed number and D may be an even integer.Referring to above Equation 24, it may be appreciated that the number ofbits to be repeated may be calculated by multiplying C by a givenN_(outer) and adding D thereto.

The parameters C and D for the repetition may be selected based onfollowing Table 12. That is, the repeaters 216 and 317 may determine theC and D based on a corresponding mode as shown in following Table 12.

TABLE 12 N_(ldpc) _(—) _(parity) N_(outer) K_(sig) K_(ldpc) C D(=N_(inner) − K_(ldpc)) η_(MOD) L1-Basic Mode 1 368 200 3240 0 367212960 2 L1-Detail Mode 1 568~2520 400~2352 3240 61/16 −508 12960 2

Further, the repeaters 216 and 317 may repeat N_(repeat) LDPC paritybits.

In detail, when N_(repeat)≦N_(ldpc) _(_) _(parity), the repeaters 216and 317 may add first N_(repeat) bits of the parity permutated LDPCparity bits to the LDPC information bits as illustrated in FIG. 12. Thatis, the repeaters 216 and 317 may add a first LDPC parity bit among theparity permutated LDPC parity bits as an N_(repeat)-th LDPC parity bitafter the LDPC information bits.

When N_(repeat)>N_(ldpc) _(_) _(parity), the repeaters 216 and 317 mayadd the parity permutated N_(ldpc) _(_) _(parity) LDPC parity bits tothe LDPC information bits as illustrated in FIG. 15, and mayadditionally add an N_(repeat)−N_(ldpc) _(_) _(parity) number of theparity permutated LDPC parity bits to the N_(ldpc) _(—parity) LDPCparity bits which are first added. That is, the repeaters 216 and 317may add all the parity permutated LDPC parity bits after the LDPCinformation bits and additionally add the first LDPC parity bit to theN_(repeat)−N_(ldpc) _(_) _(parity)-th LDPC parity bit among the paritypermutated LDPC parity bits after the LDPC parity bits which are firstadded.

Therefore, in the L1-basic mode 1 and the L1-detail mode 1, theadditional N_(repeat) bits may be selected within the LDPC codeword andtransmitted.

The puncturers 217 and 318 may puncture some of the LDPC parity bitsincluded in the LDPC codeword output from the repeaters 216 and 317, andoutput a punctured LDPC codeword (that is, the remaining LDPC codewordbits other than the punctured bits and also referred to as an LDPCcodeword after puncturing) to the zero removers 218 and 321. Further,the puncturer 318 may provide information (for example, the number andpositions of punctured bits, etc.) about the punctured LDPC parity bitsto the additional parity generator 319. In this case, the additionalparity generator 319 may generate additional parity bits based thereon.

As a result, after going through the parity permutation, some LDPCparity bits may be punctured.

In this case, the punctured LDPC parity bits are not transmitted in aframe in which L1 signaling bits are transmitted. In detail, thepunctured LDPC parity bits are not transmitted in a current frame inwhich the L1-signaling bits are transmitted, and in some cases, thepunctured LDPC parity bits may be transmitted in a frame before thecurrent frame, which will be described with reference to the additionalparity generator 319.

For this purpose, the puncturers 217 and 318 may determine the number ofLDPC parity bits to be punctured per LDPC codeword and a size of onecoded block.

In detail, the puncturers 217 and 318 may calculate a temporary numberN_(punc) _(_) _(temp) of LDPC parity bits to be punctured based onfollowing Equation 25. That is, for a given N_(outer), the puncturers217 and 318 may calculate the temporary number N_(punc) _(_) _(temp) ofLDPC parity bits to be punctured based on following Equation 25.

N _(punc) _(—temp) =└A×(K _(ldpc) −N _(outer))┘+B   (25)

Referring to above Equation 25, the temporary size of bits to bepunctured may be calculated by adding a constant integer B to an integerobtained from a result of multiplying a shortening length (that is,K_(ldpc)−N_(outer)) by a preset constant A value. In the presentexemplary embodiment, it is apparent that the constant A value is set ata ratio of the number of bits to be punctured to the number of bits tobe shortened but may be variously set according to requirements of asystem.

The B value is a value which represents a length of bits to be puncturedeven when the shortening length is 0, and thus, represents a minimumlength that the punctured bits can have. Further, the A and B valuesserve to adjust an actually transmitted code rate. That is, to preparefor a case in which the length of information bits, that is, the lengthof the L1 signaling is short or a case in which the length of the L1signaling is long, the A and B values serve to adjust the actuallytransmitted code rate to be reduced.

The above K_(ldpc), A and B are listed in following Table 13 which showsparameters for puncturing. Therefore, the puncturers 217 and 318 maydetermine the parameters for puncturing according to a correspondingmode as shown in following Table 13.

TABLE 13 Signaling FEC Type N_(outer) K_(ldpc) A B N_(ldpc) _(—)_(parity) η_(MOD) L1-Basic Mode 1 368 3240 0 9360 12960 2 Mode 2 11460 2Mode 3 12360 2 Mode 4 12292 4 Mode 5 12350 6 Mode 6 12432 8 Mode 7 127768 L1-Detail Mode 1 568~2520 7/2 0 2 Mode 2 568~3240 2 6036 2 Mode 3568~6480 6480 11/16 4653 9720 2 Mode 4 29/32 3200 4 Mode 5 3/4 4284 6Mode 6 11/16 4900 8 Mode 7  49/256 8246 8

The puncturers 217 and 318 may calculate a temporary size N_(FEC) _(_)_(temp) of one coded block as shown in following Equation 31. Here, thenumber N_(ldpc) _(_) _(parity) of LDPC parity bits according to acorresponding mode is shown as above Table 13.

N _(FEC) _(_) _(temp) =N _(outer) +N _(ldpc) _(_) _(parity) −N _(punc)_(_) _(temp)   (26)

Further, the puncturers 217 and 318 may calculate a size N_(FEC) of onecoded block as shown in following Equation 27.

$\begin{matrix}{N_{FEC} = {\left\lceil \frac{N_{{FEC}\_ {temp}}}{\eta_{MOD}} \right\rceil \times \eta_{MOD}}} & (27)\end{matrix}$

In above Equation 27, η_(MOD) is a modulation order. For example, whenthe L1-basic signaling and the L1-detail signaling are modulated byQPSK, 16-QAM, 64-QAM or 256-QAM according to a corresponding mode,η_(MOD) may be 2, 4, 6 and 8 as shown in above Table 13. According toabove Equation 27, N_(FEC) may be an integer multiple of the modulationorder.

Further, the puncturers 217 and 318 may calculate the number N_(punc) ofLDPC parity bits to be punctured based on following Equation 28.

N _(punc) =N _(punc) _(_) _(temp)−(N _(FEC) −N _(FEC) _(_) _(temp))  (28)

Here, N_(punc) is 0 or a positive integer. Further, N_(FEC) is thenumber of bits of an information block which are obtained by subtractingN_(punc) bits to be punctured from N_(outer)+N_(ldpc) _(_) _(parity)bits obtained by performing the BCH encoding and the LDPC encoding onK_(sig) information bits. That is, N_(FEC) is the number of bits otherthan the repetition bits among the actually transmitted bits, and may becalled the number of shortened and punctured LDPC codeword bits.

Referring to the foregoing process, the puncturers 217 and 318multiplies A by the number of padded zero bits, that is, a shorteninglength and adding B to a result to calculate the temporary numberN_(punc) _(_) _(temp) of LDPC parity bits to be punctured.

Further, the puncturers 217 and 318 calculate the temporary numberN_(FEC) _(_) _(temp) of LDPC codeword bits to constitute the LDPCcodeword after puncturing and shortening based on the N_(punc) _(_)_(temp).

In detail, the LDPC information bits are LDPC-encoded, and the LDPCparity bits generated by the LDPC encoding are added to the LDPCinformation bits to configure the LDPC codeword. Here, the LDPCinformation bits include the BCH-encoded bits in which the L1-basicsignaling and the L1-detail signaling are BCH encoded, and in somecases, may further include padded zero bits.

In this case, since the padded zero bits are LDPC-encoded, and then, arenot transmitted to the receiver 200, the shortened LDPC codeword, thatis, the LDPC codeword (that is, shortened LDPC codeword) except thepadded zero bits may be formed of the BCH-encoded bits and LDPC paritybits.

Therefore, the puncturers 217 and 318 subtract the temporary number ofLDPC parity bits to be punctured from a sum of the number of BCH-encodedbits and the number of LDPC parity bits to calculate the N_(FEC) _(_)_(temp).

The punctured and shortened LDPC codeword (that is, LDPC codeword bitsremaining after puncturing and shortening) are mapped to constellationsymbols by various modulation schemes such as QPSK, 16-QAM, 64-QAM or256-QAM according to a corresponding mode, and the constellation symbolsmay be transmitted to the receiver 200 through a frame.

Therefore, the puncturers 217 and 318 determine the number N_(FEC) ofLDPC codeword bits to constitute the LDPC codeword after puncturing andshortening based on N_(FEC) _(_) _(temp), N_(FEC) being an integermultiple of the modulation order, and determine the number N_(punc) ofbits which need to be punctured based on LDPC codeword bits aftershortening to obtain the N_(FEc).

When zero bits are not padded, an LDPC codeword may be formed ofBCH-encoded bits and LDPC parity bits, and the shortening may beomitted.

Further, in the L1-basic mode 1 and the L1-detail mode 1, repetition isperformed, and thus, the number of shortened and punctured LDPC codewordbits is equal to N_(FEC)+N_(repeat).

The puncturers 217 and 318 may puncture the LDPC parity bits as many asthe calculated number.

In this case, the puncturers 217 and 318 may puncture the last N_(punc)bits of all the LDPC codewords. That is, the puncturers 217 and 318 maypuncture the N_(punc) bits from the last LDPC parity bits.

In detail, when the repetition is not performed, the parity permutatedLDPC codeword includes only LDPC parity bits generated by the LDPCencoding.

In this case, the puncturers 217 and 318 may puncture the last N_(punc)bits of all the parity permutated LDPC codewords. Therefore, theN_(punc) bits from the last LDPC parity bits among the LDPC parity bitsgenerated by the LDPC encoding may be punctured.

When the repetition is performed, the parity permutated and repeatedLDPC codeword includes the repeated LDPC parity bits and the LDPC paritybits generated by the LDPC encoding.

In this case, the puncturers 217 and 318 may puncture the last N_(punc)bits of all the parity permutated and repeated LDPC codewords,respectively, as illustrated in FIGS. 14 and 15.

In detail, the repeated LDPC parity bits are positioned between the LDPCinformation bits and the LDPC parity bits generated by the LDPCencoding, and thus, the puncturers 217 and 318 may puncture the N_(punc)bits from the last LDPC parity bits among the LDPC parity bits generatedby the LDPC encoding, respectively.

As such, the puncturers 217 and 318 may puncture the N_(punc) bits fromthe last LDPC parity bits, respectively.

N_(punc) is 0 or a positive integer and the repetition may be appliedonly to the L1-basic mode 1 and the L1-detail mode 1.

The foregoing example describes that the repetition is performed, andthen, the puncturing is performed, which is only one example. In somecases, after the puncturing is performed, the repetition may beperformed.

The additional parity generator 319 may select bits from the LDPC paritybits to generate additional parity (AP) bits.

In this case, the additional parity bits may be selected from the LDPCparity bits generated based on the L1-detail signaling transmitted in acurrent frame, and transmitted to the receiver 200 through a framebefore the current frame, that is, a previous frame.

In detail, the L1-detail signaling is LDPC-encoded, and the LDPC paritybits generated by the LDPC encoding are added to the L1-detail signalingto configure an LDPC codeword.

Further, puncturing and shortening are performed on the LDPC codeword,and the punctured and shortened LDPC codeword may be mapped to a frameto be transmitted to the receiver 200. Here, when the repetition isperformed according to a corresponding mode, the punctured and shortenedLDPC codeword may include the repeated LDPC parity bits.

In this case, the L1-detail signaling corresponding to each frame may betransmitted to the receiver 200 through each frame, along with the LDPCparity bits. For example, the punctured and shortened LDPC codewordincluding the L1-detail signaling corresponding to an (i−1)-th frame maybe mapped to the (i−1)-th frame to be transmitted to the receiver 200,and the punctured and shortened LDPC codeword including the L1-detailsignaling corresponding to the i-th frame may be mapped to the i-thframe to be transmitted to the receiver 200.

The additional parity generator 319 may select at least some of the LDPCparity bits generated based on the L1-detail signaling transmitted inthe i-th frame to generate the additional parity bits.

In detail, some of the LDPC parity bits generated by performing the LDPCencoding on the L1-detail signaling are punctured, and then, are nottransmitted to the receiver 200. In this case, the additional paritygenerator 319 may select at least some of the punctured LDPC parity bitsamong the LDPC parity bits generated by performing the LDPC encoding onthe L1-detail signaling transmitted in the i-th frame, therebygenerating the additional parity bits.

Further, the additional parity generator 319 may select at least some ofthe LDPC parity bits to be transmitted to the receiver 200 through thei-th frame to generate the additional parity bits.

In detail, the LDPC parity bits included in the punctured and shortenedLDPC codeword to be mapped to the i-th frame may be configured of onlythe LDPC parity bits generated by the LDPC encoding according to acorresponding mode or the LDPC parity bits generated by the LDPCencoding and the repeated LDPC parity bits.

In this case, the additional parity generator 319 may select at leastsome of the LDPC parity bits included in the punctured and shortenedLDPC codeword to be mapped to the i-th frame to generate the additionalparity bits.

The additional parity bits may be transmitted to the receiver 200through the frame before the i-th frame, that is, the (i−1)-th frame.

That is, the transmitter 100 may not only transmit the punctured andshortened LDPC codeword including the L1-detail signaling correspondingto the (i−1)-th frame but also transmit the additional parity bitsgenerated based on the L1-detail signaling transmitted in the i-th frameto the receiver 200 through the (i−1)-th frame.

In this case, the frame in which the additional parity bits aretransmitted may be temporally the most previous frame among the framesbefore the current frame.

For example, the additional parity bits have the same bootstrapmajor/minor version as the current frame among the frames before thecurrent frame, and may be transmitted in temporally the most previousframe.

In some cases, the additional parity generator 319 may not generate theadditional parity bits.

In this case, the transmitter 100 may transmit information about whetheradditional parity bits for an L1-detail signaling of a next frame aretransmitted through the current frame to the receiver 200 using anL1-basic signaling transmitted through the current frame.

For example, the use of the additional parity bits for the L1-detailsignaling of the next frame having the same bootstrap major/minorversion as the current frame may be signaled through a fieldL1B_L1_Detail_additional_parity_mode of the L1-basic parameter of thecurrent frame. In detail, when the L1B_L1_Detail_additional_parity_modein the L1-basic parameter of the current frame is set to be ‘00’,additional parity bits for the L1-detail signaling of the next frame arenot transmitted in the current frame.

As such, to additionally increase robustness of the L1-detail signaling,the additional parity bits may be transmitted in the frame before thecurrent frame in which the L1-detail signaling of the current frame istransmitted.

FIG. 16 illustrates an example in which the additional parity bits forthe L1-detail signaling of the i-th frame are transmitted in a preambleof the (i−1)-th frame.

FIG. 16 illustrates that the L1-detail signaling transmitted through thei-th frame is segmented into M blocks by segmentation and each of thesegmented blocks is FEC encoded.

Therefore, M number of LDPC codewords, that is, an LDPC codewordincluding LDPC information bits L1-D(i)_1 and parity bits parity forL1-D(i)_1 therefor, . . . , and an LDPC codeword including LDPCinformation bits L1-D(i)_M and parity bits parity for L1-D(i)_M thereforare mapped to the i-th frame to be transmitted to the receiver 200.

In this case, the additional parity bits generated based on theL1-detail signaling transmitted in the i-th frame may be transmitted tothe receiver 200 through the (i−1)-th frame.

In detail, the additional parity bits, that is, AP for L1-D(i)_1, . . .AP for L1-D(i)_M generated based on the L1-detail signaling transmittedin the i-th frame may be mapped to the preamble of the (i−1)-th frame tobe transmitted to the receiver 200. As a result of using the additionalparity bits, a diversity gain for the L1 signaling may be obtained.

Hereinafter, a method for generating additional parity bits will bedescribed in detail.

The additional parity generator 319 calculates a temporary number N_(AP)_(_) _(temp) of additional parity bits based on following Equation 29.

$\begin{matrix}{{{N_{{AP}\_ {temp}} = {\min \begin{Bmatrix}{{0.5 \times K \times \left( {N_{outer} + N_{{ldpc}\_ {parity}} - N_{punc} + N_{repeat}} \right)},} \\\left( {N_{{ldpc}\_ {parity}} + N_{punc} + N_{repeat}} \right)\end{Bmatrix}}},{K = 0},1,2}{{\min \left( {a,b} \right)} = \left\{ \begin{matrix}{a,{{{if}\mspace{14mu} a} \leq b}} \\{b,{{{if}\mspace{14mu} b} < a}}\end{matrix} \right.}} & (29)\end{matrix}$

In above Equation 29,

Further, K represents a ratio of the additional parity bits to a half ofa total number of bits of a transmitted coded L1-detail signaling block(that is, bits configuring the L1-detail signaling block repeated,punctured, and have the zero bits removed (that is, shortened)).

In this case, K corresponds to an L1B_L1_Detail_additional_parity_modefield of the L1-basic signaling. Here, a value of theL1B_L1_Detail_additional_parity_mode associated with the L1-detailsignaling of the i-th frame (that is, frame (#i)) may be transmitted inthe (i−1)-th frame (that is, frame (#i−1)).

As described above, when L1 detail modes are 2, 3, 4, 5, 6 and 7, sincerepetition is not performed, in above Equation 39, N_(repeat) is 0.

Further, the additional parity generator 319 calculates the numberN_(AP) of additional parity bits based on following Equation 30.Therefore, the number N_(AP) of additional parity bits may be an integermultiple of a modulation order.

$\begin{matrix}{N_{AP} = {\left\lceil \frac{N_{{AP}\_ {temp}}}{\eta_{MOD}} \right\rceil \times \eta_{MOD}}} & (30)\end{matrix}$

In above Equation 30, └x┘ is a maximum integer which is not greater thanx. Here, η_(MOD) is the modulation order. For example, when theL1-detail signaling is modulated by QPSK, 16-QAM, 64-QAM or 256-QAMaccording to a corresponding mode, the η_(MOD) may be 2, 4, 6 or 8,respectively.

As such, the number of additional parity bits to be generated may bedetermined based on the total number of bits transmitted in the currentframe.

Next, the additional parity generator 319 may select bits as many as thenumber of bits calculated in the LDPC parity bits to generate theadditional parity bits.

In detail, when the number of punctured LDPC parity bits is equal to orgreater than the number of additional parity bits to be generated, theadditional parity generator 319 may select bits as many as thecalculated number from the first LDPC parity bit among the puncturedLDPC parity bits to generate the additional parity bits.

When the number of punctured LDPC parity bits is less than the number ofadditional parity bits to be generated, the additional parity generator319 may first select all the punctured LDPC parity bits and additionallyselect bits as many as the number obtained by subtracting the number ofpunctured LDPC parity bits from the number of additional parity bits tobe generated, from the first LDPC parity bit among the LDPC parity bitsincluded in the LDPC codeword to generate the additional parity bits.

In detail, when the repetition is not performed, LDPC parity bitsincluded in a repeated LDPC codeword are the LDPC parity bits generatedby the LDPC encoding.

In this case, the additional parity generator 319 may first select allthe punctured LDPC parity bits and additionally select bits as many asthe number obtained by subtracting the number of punctured LDPC paritybits from the number of additional parity bits to be generated, from thefirst LDPC parity bit among the LDPC parity bits generated by the LDPCencoding, to generate the additional parity bits.

Here, the LDPC parity bits generated by the LDPC encoding are dividedinto the non-punctured LDPC parity bits and the punctured LDPC paritybits. As a result, when bits are selected from the first bit among theLDPC parity bits generated by the LDPC encoding, they may be selected inan order of the non-punctured LDPC parity bits and the punctured LDPCparity bits.

When the repetition is performed, the LDPC parity bits included in therepeated LDPC codeword are the repeated LDPC parity bits and the LDPCparity bits generated by the LDPC encoding. Here, the repeated LDPCparity bits are positioned between the LDPC information bits and theLDPC parity bits generated by the LDPC encoding.

In this case, the additional parity generator 319 may first select allthe punctured LDPC parity bits and additionally select the bits as manyas the number obtained by subtracting the number of punctured LDPCparity bits from the number of additional bits, from the first LDPCparity bit among the repeated LDPC parity bits to generate theadditional parity bits.

Here, when the bits are selected from the first bit among the repeatedLDPC parity bits, they may be selected in an order of the repetitionbits and the LDPC parity bits generated by the LDPC encoding. Further,the bits may be selected in an order of the non-punctured LDPC paritybits and the punctured LDPC parity bits, within the LDPC parity bitsgenerated by the LDPC encoding.

Hereinafter, methods for generating additional parity bits according toexemplary embodiments will be described in more detail with reference toFIGS. 17 to 19.

FIGS. 17 to 19 are diagrams for describing the method for generatingadditional parity bits when repetition is performed, according to theexemplary embodiment. In this case, the repeated LDPC codeword V=(v₀,v₁, . . . , v_(N) _(inner) _(+N) _(repeat) ⁻¹) may be represented asillustrated in FIG. 17.

First, in the case of N_(AP)≦N_(punc), as illustrated in FIG. 18, theadditional parity generator 319 may select N_(AP) bits from the firstLDPC parity bit among punctured LDPC parity bits to generate theadditional parity bits.

Therefore, for the additional parity bits, the punctured LDPC paritybits (v_(N) _(repeat) _(+N) _(inner) _(−N) _(punc) , v_(N) _(repeat)_(+N) _(inner) _(−N) _(punc) ₊₁, . . . , v_(N) _(repeat) _(+N) _(inner)_(−N) _(punc) _(−N) _(AP) ⁻¹) may be selected. That is, the additionalparity generator 319 may select N_(AP) bits from the first LDPC paritybit among the punctured LDPC parity bits to generate the additionalparity bits.

Meanwhile, in the case of N_(AP)>N_(punc), as illustrated in FIG. 19,the additional parity generator 319 selects all the punctured LDPCparity bits.

Therefore, for the additional parity bits, all the punctured LDPC paritybits (v_(N) _(repeat) _(+N) _(inner) _(−N) _(punc) , v_(N) _(repeat)_(+N) _(inner) _(−N) _(punc) ₊₁, . . . , v_(N) _(repeat) _(+N) _(inner)⁻¹) may be selected.

Further, the additional parity generator 319 may additionally selectfirst N_(AP)−N_(punc) bits from the LDPC parity bits including therepeated LDPC parity bits and the LDPC parity bits generated by the LDPCencoding.

That is, since the repeated LDPC parity bits and the LDPC parity bitsgenerated by the LDPC encoding are sequentially arranged, the additionalparity generator 319 may additionally select the N_(AP)−N_(punc) paritybits from the first LDPC parity bit among the LDPC parity bits added bythe repetition.

Therefore, for the additional parity bits, the LDPC parity bits (v_(K)_(ldpc) , v_(K) _(ldpc) ₊₁, . . . , v_(K) _(ldpc) _(+N) _(AP) _(−N)_(punc) ⁻¹) may be additionally selected.

In this case, the additional parity generator 319 may add theadditionally selected bits to the previously selected bits to generatethe additional parity bits. That is, as illustrated in FIG. 19, theadditional parity generator 319 may add the additionally selected LDPCparity bits to the punctured LDPC parity bits to generate the additionalparity bits.

As a result, for the additional parity bits, (v_(N) _(repeat) _(+N)_(inner) _(−N) _(punc) , v_(N) _(repeat) _(+N) _(inner) _(−N) _(punc)₊₁, . . . , v_(N) _(repeat) _(+N) _(inner) ⁻¹, v_(K) _(ldpc) , v_(K)_(ldpc) ₊₁, . . . , v_(K) _(ldpc) _(+N) _(AP) _(−N) _(punc) ⁻¹) may beselected.

As such, when the number of punctured bits is equal to or greater thanthe number of additional parity bits, the additional parity bits may begenerated by selecting bits among the punctured bits based on thepuncturing order. However, in other cases, the additional parity bitsmay be generated by selecting all the punctured bits and theN_(AP)−N_(punc) parity bits.

Since N_(repeat)=0 when repetition is not performed, the method forgenerating additional parity bits when the repetition is not performedis the same as the case in which N_(repeat)=0 in FIGS. 17 to 19.

The additional parity bits may be bit-interleaved, and may be mapped toconstellation. In this case, the constellation for the additional paritybits may be generated by the same method as constellation for theL1-detail signaling bits transmitted in the current frame, in which theL1-detail signaling bits are repeated, punctured, and have the zero bitsremoved. Further, as illustrated in FIG. 18, after being mapped to theconstellation, the additional parity bits may be added after theL1-detail signaling block in a frame before the current frame in whichthe L1-detail signaling of the current frame is transmitted.

The additional parity generator 319 may output the additional paritybits to a bit demultiplexer 323.

As described above in reference to Tables 10 and 11, the group-wiseinterleaving pattern defining the permutation order may have twopatterns: a first pattern and a second pattern.

In detail, since the B value of above Equation 25 represents the minimumlength of the LDPC parity bits to be punctured, the predetermined numberof bits may be always punctured depending on the B value regardless ofthe length of the input signaling. For example, in the L1-detail mode 2,since B=6036 and the bit group is formed of 360 bits, even when theshortening length is 0, at least

$\left\lfloor \frac{6036}{360} \right\rfloor = 16$

bit groups are always punctured.

In this case, since the puncturing is performed from the last LDPCparity bit, the predetermined number of bit groups from a last bit groupamong the plurality of bit groups configuring the group-wise interleavedLDPC parity bits may be always punctured regardless of the shorteninglength.

For example, in the L1-detail mode 2, the last 16 bit groups among 36bit groups configuring the group-wise interleaved LDPC parity bits maybe always punctured.

As a result, some of the group-wise interleaving patterns defining thepermutation order represent bit groups always to punctured, andtherefore, the group-wise interleaving pattern may be divided into twopatterns. In detail, a pattern defining the remaining bit groups otherthan the bit groups to be always punctured in the group-wiseinterleaving pattern is referred to as the first pattern, and thepattern defining the bit groups to be always punctured is referred to asthe second pattern.

For example, in the L1-detail mode 2, since the group-wise interleavingpattern is defined as above Table 10, a pattern representing indexes ofbit groups which are not group-wise interleaved and positioned in a 9-thbit group to a 28-th bit group after group-wise interleaving, that is,Y₉=X_(πp(9))=X₉, Y₁₀=X_(πp(10))=X₃₁, Y₁₁=X_(πp(11))=X₂₃, . . . ,Y₂₆=X_(πp(26))=X₁₇, Y₂₇=X_(πp(27))=X₃₅, Y₂₈=X_(πp(28))=X₂₁ may be thefirst pattern, and a pattern representing indexes of bit groups whichare not group-wise interleaved and positioned in a 29-th bit group to a44-th bit group after group-wise interleaving, that is,Y₂₉=X_(πp(29))=X₂₀, Y₃₀=X_(πp(30))=X₂₄, Y₃₁=X_(πp(31))=X₄₄, . . . ,Y₄₂=X_(πp(42))=X₂₈, Y₄₃=X_(πp(43))=X₃₉, Y₄₄=X_(πp(44))=X₄₂ may be thesecond pattern.

As described above, the second pattern defines bit groups to be alwayspunctured in a current frame regardless of the shortening length, andthe first pattern defines bit groups additionally to be punctured as theshortening length is long, such that the first pattern may be used todetermine the LDPC parity bits to be transmitted in the current frameafter the puncturing.

In detail, according to the number of LDPC parity bits to be punctured,in addition to the LDPC parity bits to be always punctured, more LDPCparity bits may additionally be punctured.

For example, in the L1-detail mode 2, when the number of LDPC paritybits to be punctured is 7200, 20 bit groups need to be punctured, andthus, four (4) bit groups need to be additionally punctured, in additionto the 16 bit groups to be always punctured.

In this case, the additionally punctured four (4) bit groups correspondto the bit groups positioned at 25-th to 28-th positions aftergroup-wise interleaving, and since these bit groups are determinedaccording to the first pattern, that is, belong to the first pattern,the first pattern may be used to determine the punctured bit groups.

That is, when LDPC parity bits are punctured more than a minimum valueof LDPC parity bits to be punctured, which bit groups are to beadditionally punctured is determined according to which bit groups arepositioned after the bit groups to be always punctured. As a result,according to a puncturing direction, the first pattern which defines thebit groups positioned after the bit groups to be always punctured may beconsidered as determining the punctured bit groups.

That is, as in the foregoing example, when the number of LDPC paritybits to be punctured is 7200, in addition to the 16 bit groups to bealways punctured, four (4) bit groups, that is, the bit groupspositioned at 28-th, 27-th, 26-th, and 25-th positions, after group-wiseinterleaving is performed, are additionally punctured. Here, the bitgroups positioned at 25-th to 28-th positions after the group-wiseinterleaving are determined according to the first pattern.

As a result, the first pattern may be considered as being used todetermine the bit groups to be punctured. Further, the remaining LDPCparity bits other than the punctured LDPC parity bits are transmittedthrough the current frame, and therefore, the first pattern may beconsidered as being used to determine the bit groups transmitted in thecurrent frame.

The second pattern may be used to determine the additional parity bitsto be transmitted in the previous frame.

In detail, since the bit groups determined to be always punctured arealways punctured, and then, are not transmitted in the current frame,these bit groups need to be positioned only where bits are alwayspunctured after group-wise interleaving. Therefore, it is not importantat which position of these bit groups are positioned after thegroup-wise interleaving.

For example, in the L1-detail mode 2, bit groups positioned at 20-th,24-th, 44-th, . . . , 28-th, 39-th and 42-th positions before thegroup-wise interleaving need to be positioned only at a 29-th bit groupto a 44-th bit group after the group-wise interleaving. Therefore, it isnot important at which positions of these bit groups are positioned.

As such, the second pattern defining bit groups to be always puncturedis used to identify bit groups to be punctured. Therefore, defining anorder between the bit groups in the second pattern is meaningless in thepuncturing, and thus, the second pattern defining bit groups to bealways punctured may be considered as not being used for the puncturing.

However, for determining additional parity bits, positions of the bitgroups to be always punctured within these bit groups need to beconsidered.

In detail, since the additional parity bits are generated by selectingbits as many as a predetermined number from the first bit among thepunctured LDPC parity bits, bits included in at least some of the bitgroups to be always punctured may be selected as at least some of theadditional parity bits depending on the number of punctured LDPC paritybits and the number of additional parity bits to be generated.

That is, when additional parity bits are selected over the number of bitgroups defined according to the first pattern, since the additionalparity bits are sequentially selected from a start portion of the secondpattern, the order of the bit groups belonging to the second pattern ismeaningful in terms of selection of the additional parity bits. As aresult, the second pattern defining bit groups to be always puncturedmay be considered as being used to determine the additional parity bits.

For example, in the L1-detail mode 2, the total number of LDPC paritybits is 12960 and the number of bit groups to be always punctured is 16.

In this case, the second pattern may be used to generate the additionalparity bits depending on whether a value obtained by subtracting thenumber of LDPC parity bits to be punctured from the number of all LDPCparity bits and adding the subtraction result to the number ofadditional parity bits to be generated exceeds 7200. Here, 7200 is thenumber of LDPC parity bits except the bit groups to be always punctured,among the bit groups configuring the LDPC parity bits. That is,7200=(36-16)×360.

In detail, when the value obtained by the above subtraction and additionis equal to or less than 7200, that is,12960−N_(punc)+N_(punc)+N_(AP)≦7200, the additional parity bits may begenerated according to the first pattern.

However, when the value obtained by the above subtraction and additionexceeds 7200, that is, 12960−N_(punc)+N_(AP)>7200, the additional paritybits may be generated according to the first pattern and the secondpattern.

In detail, when 12960−N_(punc)+N_(AP)>7200, for the additional paritybits, bits included in the bit group positioned at a 28-th position fromthe first LDPC parity bit among the punctured LDPC parity bits may beselected, and bits included in the bit group positioned at apredetermined position from a 29-th position may be selected.

Here, the bit group to which the first LDPC parity bit among thepunctured LDPC parity bits belongs and the bit group (that is, whenbeing sequentially selected from the first LDPC parity bit among thepunctured LDPC parity bits, a bit group to which the finally selectedLDPC parity bits belong) at the predetermined position may be determineddepending on the number of punctured LDPC parity bits and the number ofadditional parity bits to be generated.

In this case, the bit group positioned at the 28-th position from thefirth LDPC parity bit among the punctured LDPC parity bits is determinedaccording to the first pattern, and the bit group positioned at thepredetermined position from the 29-th position is determined accordingto the second pattern.

As a result, the additional parity bits are determined according to thefirst pattern and the second pattern.

As such, the first pattern may be used to determine additional paritybits to be generated as well as LDPC parity bits to be punctured, andthe second pattern may be used to determine the additional parity bitsto be generated and LDPC parity bits to be always punctured regardlessof the number of parity bits to be punctured by the puncturers 217 and318.

The foregoing example describes that the group-wise interleaving patternincludes the first pattern and the second pattern, which is only forconvenience of explanation in terms of the puncturing and the additionalparity. That is, the group-wise interleaving pattern may be consideredas one pattern without being divided into the first pattern and thesecond pattern. In this case, the group-wise interleaving may beconsidered as being performed with one pattern both for the puncturingand the additional parity.

The values used in the foregoing example such as the number of puncturedLDPC parity bits are only example values.

The zero removers 218 and 321 may remove zero bits padded by the zeropadders 213 and 314 from the LDPC codewords output from the puncturers217 and 318, and output the remaining bits to the bit demultiplexers 219and 322.

Here, the removal does not only remove the padded zero bits but also mayinclude outputting the remaining bits other than the padded zero bits inthe LDPC codewords.

In detail, the zero removers 218 and 321 may remove K_(ldpc)−N_(outer)zero bits padded by the zero padders 213 and 314. Therefore, theK_(ldpc)−N_(outer) padded zero bits are removed, and thus, may not betransmitted to the receiver 200.

For example, as illustrated in FIG. 20, it is assumed that all bits of afirst bit group, a fourth bit group, a fifth bit group, a seventh bitgroup, and an eighth bit group among a plurality of bit groupsconfiguring an LDPC codeword are padded by zero bits, and some bits ofthe second bit group are padded by zero bits.

In this case, the zero removers 218 and 321 may remove the zero bitspadded to the first bit group, the second bit group, the fourth bitgroup, the fifth bit group, the seventh bit group, and the eighth bitgroup.

As such, when zero bits are removed, as illustrated in FIG. 20, an LDPCcodeword formed of K_(sig) information bits (that is, K_(sig) L1-basicsignaling bits and K_(sig) L1-detail signaling bits), 168 BCH paritycheck bits (that is, BCH FEC), and N_(inner)−K_(ldpc)−N_(punc) orN_(inner)−K_(ldpc)−N_(punc)+N_(repeat) parity bits may remain.

That is, when repetition is performed, the lengths of all the LDPCcodewords become N_(FEC)+N_(repeat). Here, N_(FEC)=N_(outer)+N_(ldpc)_(_) _(parity)−N_(punc). However, in a mode in which the repetition isnot performed, the lengths of all the LDPC codewords become N_(FEC).

The bit demultiplexers 219 and 322 may interleave the bits output fromthe zero removers 218 and 321, demultiplex the interleaved bits, andthen output them to the constellation mappers 221 and 324.

For this purpose, the bit demultiplexers 219 and 322 may include a blockinterleaver (not illustrated) and a demultiplexer (not illustrated).

First, a block interleaving scheme performed in the block interleaver isillustrated in FIG. 21.

In detail, the bits of the N_(FEC) or N_(FEC)+N_(repeat) length afterthe zero bits are removed may be column-wisely serially written in theblock interleaver. Here, the number of columns of the block interleaveris equivalent to the modulation order and the number of rows isN_(FEC)/η_(MOD) or (N_(FEC)+N_(repeat))/η_(MOD).

Further, in a read operation, bits for one constellation symbol may besequentially read in a row direction to be input to the demultiplexer.The operation may be continued to the last row of the column.

That is, the N_(FEC) or (N_(FEC)±N_(repeat)) bits may be written in aplurality of columns in a column direction from the first row of thefirst column, and the bits written in the plurality of columns aresequentially read from the first row to the last row of the plurality ofcolumns in a row direction. In this case, the bits read in the same rowmay configure one modulation symbol.

The demultiplexer may demultiplex the bits output from the blockinterleaver.

In detail, the demultiplexer may demultiplex each of theblock-interleaved bit groups, that is, the bits output while being readin the same row of the block interleaver within the bit groupbit-by-bit, before the bits are mapped to constellation.

In this case, two mapping rules may be present according to themodulation order.

In detail, when QPSK is used for modulation, since reliability of bitswithin a constellation symbol is the same, the demultiplexer does notperform the demultiplexing operation on a bit group. Therefore, the bitgroup read and output from the block interleaver may be mapped to a QPSKsymbol without the demultiplexing operation.

However, when high order modulation is used, the demultiplexer mayperform demultiplexing on a bit group read and output from the blockinterleaver based on following Equation 31. That is, a bit group may bemapped to a QAM symbol depending on following Equation 31.

S _(demux) _(_) _(in(i)) ={b _(i)(0),b _(i)(1),b _(i)(2), . . . ,b_(i)(η_(MOD)−1)},

S _(demux) _(_) _(out(i)) ={c _(i)(0),c _(i)(1),c _(i)(2), . . . ,c_(i)(η_(MOD)−1)},

c _(i)(0)=b _(i)(i% η_(MOD)),c _(i)(1)=b _(i)((i+1)%η_(MOD)), . . . ,c_(i)(η_(MOD)−1)=b _(i)((i+η _(MOD)−1)% η_(MOD))   (31)

In the above Equation 31, % represents a modulo operation, and η_(MOD)is a modulation order.

Further, i is a bit group index corresponding to a row index of theblock interleaver. That is, an output bit group S_(demux) _(_) _(out(i))mapped to each of the QAM symbols may be cyclic-shifted in an S_(demux)_(_) _(in(i)) according to the bit group index i.

FIG. 22 illustrates an example of performing bit demultiplexing on16-non uniform constellation (16-NUC), that is, NUC 16-QAM. Theoperation may be continued until all bit groups are read in the blockinterleaver.

The bit demultiplexer 323 may perform the same operation as theoperations performed by the bit demultiplexers 219 and 322, on theadditional parity bits output from the additional parity generator 319,and output the block-interleaved and demultiplexed bits to theconstellation mapper 325.

The constellation mappers 221, 324 and 325 may map the bits output fromthe bit demultiplexers 219, 322 and 323 to constellation symbols,respectively.

That is, each of the constellation mappers 221, 324 and 325 may map theS_(demux) _(_) _(out(i)) to a cell word using constellation according toa corresponding mode. Here, the S_(demux) _(_) _(out(i)) may beconfigured of bits having the same number as the modulation order.

In detail, the constellation mappers 221, 324 and 325 may map bitsoutput from the bit demultiplexers 219, 322 and 323 to constellationsymbols using QPSK, 16-QAM, 64-QAM, the 256-QAM, etc., according to acorresponding mode.

In this case, the constellation mappers 221, 324 and 325 may use theNUC. That is, the constellation mappers 221, 324 and 325 may use NUC16-QAM, NUC 64-QAM or NUC 256-QAM. The modulation scheme applied to theL1-basic signaling and the L1-detail signaling according to acorresponding mode is shown in above Table 5.

The transmitter 100 may map the constellation symbols to a frame andtransmit the mapped symbols to the receiver 200.

In detail, the transmitter 100 may map the constellation symbolscorresponding to each of the L1-basic signaling and the L1-detailsignaling output from the constellation mappers 221 and 324, and map theconstellation symbols corresponding to the additional parity bits outputfrom the constellation mapper 325 to a preamble symbol of a frame.

In this case, the transmitter 100 may map the additional parity bitsgenerated based on the L1-detail signaling transmitted in the currentframe to a frame before the current frame.

That is, the transmitter 100 may map the LDPC codeword bits includingthe L1-basic signaling corresponding to the (i−1)-th frame to the(i−1)-th frame, maps the LDPC codeword bits including the L1-detailsignaling corresponding to the (i−1)-th frame to the (i−1)-th frame, andadditionally map the additional parity bits generated selected from theLDPC parity bits generated based on the L1-detail signalingcorresponding to the i-th frame to the (i−1)-th frame and may transmitthe mapped bits to the receiver 200.

In addition, the transmitter 100 may map data to the data symbols of theframe in addition to the L1 signaling and transmit the frame includingthe L1 signaling and the data to the receiver 200.

In this case, since the L1 signalings include signaling informationabout the data, the signaling about the data mapped to each data may bemapped to a preamble of a corresponding frame. For example, thetransmitter 100 may map the L1 signaling including the signalinginformation about the data mapped to the i-th frame to the i-th frame.

As a result, the receiver 200 may use the signaling obtained from theframe to receive the data from the corresponding frame for processing.

FIGS. 23 and 24 are block diagrams for describing a configuration of areceiver according to an exemplary embodiment.

In detail, as illustrated in FIG. 23, the receiver 200 may include aconstellation demapper 2210, a multiplexer 2220, a Log Likelihood Ratio(LLR) 2230, an LLR combiner 2240, a parity depermutator 2250, an LDPCdecoder 2260, a zero remover 2270, a BCH decoder 2280, and a descrambler2290 to process the L1-basic signaling.

Further, as illustrated in FIG. 24, the receiver 200 may includeconstellation demappers 2311 and 2312, multiplexers 2321 and 2322, anLLR inserter 2330, an LLR combiner 2340, a parity depermutator 2350, anLDPC decoder 2360, a zero remover 2370, a BCH decoder 2380, adescrambler 2390, and a desegmenter 2395 to process the L1-detailsignaling.

Here, the components illustrated in FIGS. 23 and 24 perform functionscorresponding to the functions of the components illustrated in FIGS. 7and 8, respectively, which is only an example, and in some cases, someof the components may be omitted and changed and other components may beadded.

The receiver 200 may acquire frame synchronization using a bootstrap ofa frame and receive L1-basic signaling from a preamble of the frameusing information for processing the L1-basic signaling included in thebootstrap.

Further, the receiver 200 may receive L1-detail signaling from thepreamble using information for processing the L1-detail signalingincluded in the L1-basic signaling, and receive broadcasting datarequired by a user from data symbols of the frame using the L1-detailsignaling.

Therefore, the receiver 200 may determine a mode used at the transmitter100 to process the L1-basic signaling and the L1-detail signaling, andprocess a signal received from the transmitter 100 according to thedetermined mode to receive the L1-basic signaling and the L1-detailsignaling. For this purpose, the receiver 200 may pre-store informationabout parameters used at the transmitter 100 to process the signalingaccording to corresponding modes.

As such, the L1-basic signaling and the L1-detail signaling may besequentially acquired from the preamble. In describing FIGS. 23 and 24,components performing common functions will be described together forconvenience of explanation.

The constellation demappers 2210, 2311 and 2312 demodulate a signalreceived from the transmitter 100.

In detail, the constellation demapppers 2210, 2311 and 2312 arecomponents corresponding to the constellation mappers 221, 324 and 325of the transmitter 100, respectively, and may demodulate the signalreceived from the transmitter 100 and generate values corresponding tobits transmitted from the transmitter 100.

That is, as described above, the transmitter 100 maps an LDPC codewordincluding the L1-basic signaling and the LDPC codeword including theL1-detail signaling to the preamble of a frame, and transmits the mappedLDPC codeword to the receiver 200. Further, in some cases, thetransmitter 100 may map additional parity bits to the preamble of aframe and transmit the mapped bits to the receiver 200.

As a result, the constellation demappers 2210 and 2311 may generatevalues corresponding to the LDPC codeword bits including the L1-basicsignaling and the LDPC codeword bits including the L1-detail signaling.Further, the constellation demapper 2312 may generate valuescorresponding to the additional parity bits.

For this purpose, the receiver 200 may pre-store information about amodulation scheme used by the transmitter 100 to modulate the L1-basicsignaling, the L1-detail signaling, and the additional parity bitsaccording to corresponding modes. Therefore, the constellation demappers2210, 2311 and 2312 may demodulate the signal received from thetransmitter 100 according to the corresponding modes to generate valuescorresponding to the LDPC codeword bits and the additional parity bits.

The value corresponding to a bit transmitted from the transmitter 100 isa value calculated based on probability that a received bit is 0 and 1,and instead, the probability itself may also be used as a valuecorresponding to each bit. The value may also be a Likelihood Ratio (LR)or an LLR value as another example.

In detail, an LR value may represent a ratio of probability that a bittransmitted from the transmitter 100 is 0 and probability that the bitis 1, and an LLR value may represent a value obtained by taking a log onprobability that the bit transmitted from the transmitter 100 is 0 andprobability that the bit is 1.

The foregoing example uses the LR value or the LLR value, which is onlyone example. According to another exemplary embodiment, the receivedsignal itself rather than the LR or LLR value may also be used.

The multiplexers 2220, 2321 and 2322 perform multiplexing on the LLRvalues output from the constellation demappers 2210, 2311 and 2312.

In detail, the multiplexers 2220, 2321 and 2322 are componentscorresponding to the bit demultiplexers 219, 322 and 323 of thetransmitter 100 and may perform operations corresponding to theoperations of the bit demultiplexers 219, 322 and 323, respectively.

For this purpose, the receiver 200 may pre-store information aboutparameters used for the transmitter 100 to perform demultiplexing andblock interleaving. Therefore, the multiplexers 2220, 2321 and 2322 mayreversely perform the demultiplexing and block interleaving operationsof the bit demultiplexers 219, 322, and 323 on the LLR valuecorresponding to a cell word to multiplex the LLR value corresponding tothe cell word in a bit unit.

The LLR inserters 2230 and 2330 may insert LLR values for the puncturingand shortening bits into the LLR values output from the multiplexers2220 and 2321, respectively. In this case, the LLR inserters 2230 and2330 may insert previously determined LLR values between the LLR valuesoutput from the multiplexers 2220 and 2321 or a head portion or an endportion thereof.

In detail, the LLR inserters 2230 and 2330 are components correspondingto the zero removers 218 and 321 and the puncturers 217 and 318 of thetransmitter 100, respectively, and may perform operations correspondingto the operations of the zero removers 218 and 321 and the puncturers217 and 318, respectively.

First, the LLR inserters 2230 and 2330 may insert LLR valuescorresponding to zero bits into a position where the zero bits in theLDPC codeword are padded. In this case, the LLR values corresponding tothe padded zero bits, that is, the shortened zero bits may be ∞ or −∞.However, ∞ or −∞ are a theoretical value but may actually be a maximumvalue or a minimum value of the LLR value used in the receiver 200.

For this purpose, the receiver 200 may pre-store information aboutparameters and/or patterns used for the transmitter 100 to pad the zerobits according to corresponding modes. Therefore, the LLR inserters 2230and 2330 may determine positions where the zero bits in the LDPCcodeword are padded according to the corresponding the modes, and insertthe LLR values corresponding to the shortened zero bits intocorresponding positions.

Further, the LLR inserters 2230 and 2330 may insert the LLR valuescorresponding to the punctured bits into the positions of the puncturedbits in the LDPC codeword. In this case, the LLR values corresponding tothe punctured bits may be 0.

For this purpose, the receiver 200 may pre-store information aboutparameters and/or patterns used for the transmitter 100 to performpuncturing according to corresponding modes. Therefore, the LLRinserters 2230 and 2330 may determine the lengths of the punctured LDPCparity bits according to the corresponding modes, and insertcorresponding LLR values into the positions where the LDPC parity bitsare punctured.

When the additional parity bits selected from the punctured bits amongthe additional parity bits, the LLR inserter 2630 may insert LLR valuescorresponding to the received additional parity bits, not an LLR value‘0’ for the punctured bit, into the positions of the punctured bits.

The LLR combiners 2240 and 2340 may combine, that is, a sum the LLRvalues output from the LLR inserters 2230 and 2330 and the LLR valueoutput from the multiplexer 2322. However, the LLR combiners 2540 and2640 serve to update LLR values for specific bits into more correctvalues. However, the LLR values for the specific bits may also bedecoded from the received LLR values without the LLR combiners 2540 and2640, and therefore, in some cases, the LLR combiners 2540 and 2640 maybe omitted.

In detail, the LLR combiner 2240 is a component corresponding to therepeater 216 of the transmitter 100, and may perform an operationcorresponding to the operation of the repeater 216. Alternatively, theLLR combiner 2340 is a component corresponding to the repeater 317 andthe additional parity generator 319 of the transmitter 100 and mayperform operations corresponding to the operations of the repeater 317and the additional parity generator 319.

First, the LLR combiners 2240 and 2340 may combine LLR valuescorresponding to the repetition bits with other LLR values. Here, theother LLR values may be bits which are a basis of generating therepetition bits by the transmitter 100, that is, LLR values for the LDPCparity bits selected as the repeated object.

That is, as described above, the transmitter 100 selects bits from theLDPC parity bits and repeats the selected bits between the LDPCinformation bits and the LDPC parity bits generated by LDPC encoding,and transmits the repetition bits to the receiver 200.

As a result, the LLR values for the LDPC parity bits may be formed ofthe LLR values for the repeated LDPC parity bits and the LLR values forthe non-repeated LDPC parity bits, that is, the LDPC parity bitsgenerated by the LDPC encoding. Therefore, the LLR combiners 2240 and2340 may combine the LLR values for the same LDPC parity bits.

For this purpose, the receiver 200 may pre-store information aboutparameters used for the transmitter 100 to perform the repetitionaccording to corresponding modes. As a result, the LLR combiners 2240and 2340 may determine the lengths of the repeated LDPC parity bits,determine the positions of the bits which are a basis of the repetition,and combine the LLR values for the repeated LDPC parity bits with theLLR values for the LDPC parity bits which are a basis of the repetitionand generated by the LDPC encoding.

For example, as illustrated in FIGS. 25 and 26, the LLR combiners 2240and 2340 may combine LLR values for repeated LDPC parity bits with LLRvalues for LDPC parity bits which are a basis of the repetition andgenerated by the LDPC encoding.

When LPDC parity bits are repeated n times, the LLR combiners 2240 and2340 may combine LLR values for bits at the same position at n times orless.

For example, FIG. 25 illustrates a case in which some of LDPC paritybits other than punctured bits are repeated once. In this case, the LLRcombiners 2240 and 2340 may combine LLR values for the repeated LDPCparity bits with LLR values for the LDPC parity bits generated by theLDPC encoding, and then, output the combined LLR values or output theLLR values for the received repeated LDPC parity bits or the LLR valuesfor the received LDPC parity bits generated by the LDPC encoding withoutcombining them.

As another example, FIG. 26 illustrates a case in which some of thetransmitted LDPC parity bits, which are not punctured, are repeatedtwice, the remaining portions are repeated once, and the punctured LDPCparity bits are repeated once.

In this case, the LLR combiners 2240 and 2340 may process the remainingportion and the punctured bits which are repeated once by the samescheme as described above. However, the LLR combiners 2240 and 2340 mayprocess the portion repeated twice as follows. In this case, forconvenience of description, one of the two portions generated byrepeating some of the LDPC parity bits twice is referred to as a firstportion and the other is referred to as the second portion.

In detail, the LLR combiners 2240 and 2340 may combine LLR values foreach of the first and second portions with LLR values for the LDPCparity bits. Alternatively, the LLR combiners 2240 and 2340 may combinethe LLR values for the first portion with the LLR values for the LDPCparity bits, combine the LLR values for the second portion with the LLRvalues for the LDPC parity bits, or combine the LLR values for the firstportion with the LLR values for the second portion. Alternatively, theLLR combiners 2240 and 2340 may output the LLR values for the firstportion, the LLR values for the second portion, the LLR values for theremaining portion, and punctured bits, without separate combination.

Further, the LLR combiner 2340 may combine LLR values corresponding toadditional parity bits with other LLR values. Here, the other LLR valuesmay be the LDPC parity bits which are a basis of the generation of theadditional parity bits by the transmitter 100, that is, the LLR valuesfor the LDPC parity bits selected for generation of the additionalparity bits.

That is, as described above, the transmitter 100 may map additionalparity bits for L1-detail signaling transmitted in a current frame to aprevious frame and transmit the mapped bits to the receiver 200.

In this case, the additional parity bits may include LDPC parity bitswhich are punctured and are not transmitted in the current frame, and insome cases, may further include LDPC parity bits transmitted in thecurrent frame.

As a result, the LLR combiner 2340 may combine LLR values for theadditional parity bits received through the current frame with LLRvalues inserted into the positions of the punctured LDPC parity bits inthe LDPC codeword received through the next frame and LLR values for theLDPC parity bits received through the next frame.

For this purpose, the receiver 200 may pre-store information aboutparameters and/or patterns used for the transmitter 100 to generate theadditional parity bits according to corresponding modes. As a result,the LLR combiner 2340 may determine the lengths of the additional paritybits, determine the positions of the LDPC parity bits which are a basisof generation of the additional parity bits, and combine the LLR valuesfor the additional parity bits with the LLR values for the LDPC paritybits which are a basis of generation of the additional parity bits.

The parity depermutators 2250 and 2350 may depermutate the LLR valuesoutput from the LLR combiners 2240 and 2340, respectively.

In detail, the parity depermutators 2250 and 2350 are componentscorresponding to the parity permutators 215 and 316 of the transmitter100, and may perform operations corresponding to the operations of theparity permutators 215 and 316, respectively.

For this purpose, the receiver 200 may pre-store information aboutparameters and/or patterns used for the transmitter 100 to performgroup-wise interleaving and parity interleaving according tocorresponding modes. Therefore, the parity depermutators 2250 and 2350may reversely perform the group-wise interleaving and parityinterleaving operations of the parity permutators 215 and 316 on the LLRvalues corresponding to the LDPC codeword bits, that is, performgroup-wise deinterleaving and parity deinterleaving operations toperform the parity depermutation on the LLR values corresponding to theLDPC codeword bits, respectively.

The LDPC decoders 2260 and 2360 may perform LDPC decoding based on theLLR values output from the parity depermutators 2250 and 2350,respectively.

In detail, the LDPC decoders 2260 and 2360 are components correspondingto the LDPC encoders 214 and 315 of the transmitter 100 and may performoperations corresponding to the operations of the LDPC encoders 214 and315, respectively.

For this purpose, the receiver 200 may pre-store information aboutparameters used for the transmitter 100 to perform the LDPC encodingaccording to corresponding modes. Therefore, the LDPC decoders 2260 and2360 may perform the LDPC decoding based on the LLR values output fromthe parity depermutators 2250 and 2350 according to the correspondingmodes.

For example, the LDPC decoders 2260 and 2360 may perform the LDPCdecoding based on the LLR values output from the parity depermutators2250 and 2350 by iterative decoding based on a sum-product algorithm andoutput error-corrected bits depending on the LDPC decoding.

The zero removers 2270 and 2370 may remove zero bits from the bitsoutput from the LDPC decoders 2260 and 2360, respectively.

In detail, the zero removers 2270 and 2370 are components correspondingto the zero padders 213 and 314 of the transmitter 100 and may performoperations corresponding to the operations of the zero padders 213 and314, respectively.

For this purpose, the receiver 200 may pre-store information aboutparameters and/or patterns used for the transmitter 100 to pad the zerobits according to corresponding modes. As a result, the zero removers2270 and 2370 may remove the zero bits padded by the zero padders 213and 314 from the bits output from the LDPC decoders 2260 and 2360,respectively.

The BCH decoders 2280 and 2380 may perform BCH decoding on the bitsoutput from the zero removers 2270 and 2370, respectively.

In detail, the BCH decoders 2280 and 2380 are components correspondingto the BCH encoders 212 and 313 of the transmitter 100 and may performthe operations corresponding to the BCH encoders 212 and 313.

For this purpose, the receiver 200 may pre-store the information aboutparameters used for the transmitter 100 to perform BCH encoding. As aresult, the BCH decoders 2280 and 2380 may correct errors by performingthe BCH decoding on the bits output from the zero removers 2270 and 2370and output the error-corrected bits.

The descramblers 2290 and 2390 may descramble the bits output from theBCH decoders 2280 and 2380, respectively.

In detail, the descramblers 2290 and 2390 are components correspondingto the scramblers 211 and 312 of the transmitter 100 and may performoperations corresponding to the operations of the scramblers 211 and312.

For this purpose, the receiver 200 may pre-store information about theparameters used for the transmitter 100 to perform the scrambling. As aresult, the descramblers 2290 and 2390 may descramble the bits outputfrom the BCH decoders 2280 and 2380 and output them, respectively.

As a result, L1-basic signaling transmitted from the transmitter 100 maybe recovered. Further, when the transmitter 100 does not performsegmentation on L1-detail signaling, the L1-detail signaling transmittedfrom the transmitter 100 may also be recovered.

However, when the transmitter 100 performs the segmentation on theL1-detail signaling, the desegmenter 2395 may desegment the bits outputfrom the descrambler 2390.

In detail, the desegmenter 2395 is a component corresponding to thesegmenter 311 of the transmitter 100 and may perform an operationcorresponding to the operation of the segmenter 311.

For this purpose, the receiver 200 may pre-store information aboutparameters used for the transmitter 100 to perform the segmentation. Asa result, the desegmenter 2395 may combine the bits output from thedescrambler 2390, that is, the segments for the L1-detail signaling torecover the L1-detail signaling before the segmentation.

The information about the length of the L1 signaling is provided asillustrated in FIG. 27. Therefore, the receiver 200 may calculate thelength of the L1-detail signaling and the length of the additionalparity bits.

Referring to FIG. 27, since the L1-basic signaling provides informationabout L1-detail total cells, the receiver 200 needs to calculate thelength of the L1-detail signaling and the lengths of the additionalparity bits.

In detail, when L1B_L1_Detail_additional_parity_mode of the L1-basicsignaling is not 0, since the information on the given L1B_L1Detail_total_cells represents a total cell length (=N_(L1) _(_)_(detail) _(_) _(total)cells)), the receiver 200 may calculate thelength N_(L1) _(_) _(detail) _(_) _(cells) of the L1-detail signalingand the length N_(AP) _(_) _(total) _(_) _(cells) of the additionalparity bits based on following Equations 32 to 35.

$\begin{matrix}{N_{L\; 1{\_ {FEC}}{\_ {cells}}} = {\frac{N_{outer} + N_{repeat} + {N_{{ldpc}\_ {parity}} \cdot N_{punc}}}{\eta_{MOD}} = \frac{N_{FEC}}{\eta_{MOD}}}} & (32) \\{N_{L\; 1{\_ {detail}}{\_ {cells}}} = {N_{L\; 1{D\_ {FECFRAME}}} \times N_{L\; 1{\_ {FEC}}{\_ {cells}}}}} & (33) \\{N_{{{AP\_}{total}}{\_ {cells}}} = {N_{L\; 1{\_ {detail}}{\_ {total}}{\_ {cells}}} \cdot N_{L\; 1{\_ {detail}}{\_ {cells}}}}} & (34)\end{matrix}$

In this case, based on above Equations 32 to 34, an N_(AP) _(_) _(total)_(_) _(cells) value may be obtained based on an N_(L1) _(_) _(detail)_(_) _(total) _(_) _(cells) value which may be obtained from theinformation about the L1B_L1_Detail_total_cells of the L1-basicsignaling, N_(FEC), the N_(L1D) _(_) _(FECFRAME), and the modulationorder η_(MOD). As an example, N_(AP) _(_) _(total) _(_) _(cells) may becalculated based on following Equation 35.

$\begin{matrix}{N_{{{AP\_}{total}}{\_ {cells}}} = {{N_{L\; 1{\_ {detail}}{\_ {total}}{\_ {cells}}} \cdot N_{L\; 1{D\_ {FECFRAME}}}} \times \frac{N_{FEC}}{\eta_{MOD}}}} & (35)\end{matrix}$

A syntax, and field semantics of the L1-basic signaling field are asfollowing Table 14.

TABLE 14 Syntax # of bits Format L1_Basic_signaling( ) {L1B_L1_Detail_size_bits 16 uimsbf L1B_L1_Detail_fec_type 3 uimsbfL1B_L1_Detail_additional_parity_mode 2 uimsbf L1B_L1_Detail_total_cells19 uimsbf L1B_Reserved ? uimsbf L1B_crc 32 uimsbf {

As a result, the receiver 200 may perform an operation of the receiverfor the additional parity bits in the next frame based on the additionalparity bits transmitted to the N_(AP) _(_) _(total) _(_) _(cells) cellamong the received L1 detail cells.

FIG. 28 is a flow chart for describing a method for parity permutationaccording to an exemplary embodiment of the present disclosure.

First, parity bits are generated by encoding input bits (S2510).

Next, outer-encoded bits including the input bits and the parity bits,and LDPC information bits including the zero bits are configured(S2520).

Further, the LDPC information bits are encoded (S2530).

Meanwhile, in S2520, zero bits are padded to at least some of aplurality of bit groups configuring the LDPC information bits based on ashortening pattern as shown in above Table 1.

In S2520, the number of bit groups N_(pad) in which all bits (or bitpositions) are padded by zero bits may be calculated based on aboveEquation 3 or 4.

In S2520, zero bits may be padded to all bit positions of a π_(s)(0)-thbit group, a π_(s)(1)-th bit group, . . . , a π_(s)(N_(pad)−1)-th bitgroup of the plurality of bit groups based on the shortening pattern,and zero bits may be additionally padded toK_(ldpc)−N_(outer)−360×N_(pad) bits (or bit positions) from a first bit(or bit position) of a π_(s)(N_(pad))-th bit group.

A detailed method for performing shortening based on above Table 1 isdescribed above, and thus, duplicate descriptions are omitted.

A non-transitory computer readable medium in which a program performingthe various methods described above are stored may be provided accordingto an exemplary embodiment. The non-transitory computer readable mediumis not a medium that stores data therein for a while, such as aregister, a cache, a memory, or the like, but means a medium that atleast semi-permanently stores data therein and is readable by a devicesuch as a microprocessor. In detail, various applications or programsdescribed above may be stored and provided in the non-transitorycomputer readable medium such as a compact disk (CD), a digitalversatile disk (DVD), a hard disk, a Blu-ray disk, a universal serialbus (USB), a memory card, a read only memory (ROM), or the like.

At least one of the components, elements, modules or units representedby a block as illustrated in FIGS. 1, 9, 10, 25 and 26 may be embodiedas various numbers of hardware, software and/or firmware structures thatexecute respective functions described above, according to an exemplaryembodiment. For example, at least one of these components, elements,modules or units may use a direct circuit structure, such as a memory, aprocessor, a logic circuit, a look-up table, etc. that may execute therespective functions through controls of one or more microprocessors orother control apparatuses. Also, at least one of these components,elements, modules or units may be specifically embodied by a module, aprogram, or a part of code, which contains one or more executableinstructions for performing specified logic functions, and executed byone or more microprocessors or other control apparatuses. Also, at leastone of these components, elements, modules or units may further includeor implemented by a processor such as a central processing unit (CPU)that performs the respective functions, a microprocessor, or the like.Two or more of these components, elements, modules or units may becombined into one single component, element, module or unit whichperforms all operations or functions of the combined two or morecomponents, elements, modules or units. Also, at least part of functionsof at least one of these components, elements, modules or units may beperformed by another of these components, elements, modules or units.Further, although a bus is not illustrated in the above block diagrams,communication between the components, elements, modules or units may beperformed through the bus. Functional aspects of the above exemplaryembodiments may be implemented in algorithms that execute on one or moreprocessors. Furthermore, the components, elements, modules or unitsrepresented by a block or processing steps may employ any number ofrelated art techniques for electronics configuration, signal processingand/or control, data processing and the like.

Although the exemplary embodiments of inventive concept have beenillustrated and described hereinabove, the inventive concept is notlimited to the above-mentioned exemplary embodiments, but may bevariously modified by those skilled in the art to which the inventiveconcept pertains without departing from the scope and spirit of theinventive concept as disclosed in the accompanying claims. For example,the exemplary embodiments are described in relation with BCH encodingand decoding and LDPC encoding and decoding. However, these embodimentsdo not limit the inventive concept to only a particular encoding anddecoding, and instead, the inventive concept may be applied to differenttypes of encoding and decoding with necessary modifications. Thesemodifications should also be understood to fall within the scope of theinventive concept.

What is claimed is:
 1. A transmitter, comprising: an outer encoderconfigured to encode input bits to generate parity bits; a zero padderconfigured to constitute LDPC information bits including outer-encodedbits including the input bits and the parity bits, and zero bits; and anLDPC encoder configured to encode the LDPC information bits, wherein thezero padder pads the zero bits to at least some of a bit groupsconstituting the LDPC information bits based on pattern described below:π_(S)(j) (0 ≦ j < N_(info) _(—) _(group)) π_(S)(0) π_(S)(1) π_(S)(2)π_(S)(3) π_(S)(4) π_(S)(5) π_(S)(6) π_(S)(7) π_(S)(8) N_(info) _(—)_(group) π_(S)(9) π_(S)(10) π_(S)(11) π_(S)(12) π_(S)(13) π_(S)(14)π_(S)(15) π_(S)(16) π_(S)(17) 18 2 4 5 17 9 7 1 6 15 8 10 14 16 0 11 1312 3

where π_(s)(j) represents an order of a j-th bit group and N_(info) _(_)_(group) represents a number of the bit groups.
 2. The transmitter ofclaim 1, wherein the zero padder calculates a number N_(pad) of bitgroups in which all bits are to be padded by zero bits based on afollowing equation:${N_{pad} = \left\lfloor \frac{K_{ldpc} - N_{outer}}{360} \right\rfloor},$where K_(ldpc) represents a number of the LDPC information bits,N_(outer) represents a number of the outer-encoded bits.
 3. Thetransmitter of claim 2, wherein the zero padder pads zero bits to allbits of a π_(s)(0)-th bit group, a π_(s)(1)-th bit group, . . . , aπ_(s)(N_(pad)−1)-th bit group among the bit groups based on the pattern.4. The transmitter of claim 3, wherein the zero padder additionally padszero bits to K_(ldpc)−N_(outer)−360×N_(pad) bit positions from a firstbit of a π_(s)(N_(pad))-th bit group.
 5. A shortening method of atransmitter, comprising: generating parity bits by encoding input bits;constituting LDPC information bits including outer-encoded bitsincluding the input bits and the parity bits, and zero bits; andencoding the LDPC information bits, wherein the constituting the LDPCinformation bits comprises padding the zero bits to at least some of bitgroups constituting the LDPC information bits based on pattern describedbelow, and π_(S)(j) (0 ≦ j < N_(info) _(—) _(group)) π_(S)(0) π_(S)(1)π_(S)(2) π_(S)(3) π_(S)(4) π_(S)(5) π_(S)(6) π_(S)(7) π_(S)(8) N_(info)_(—) _(group) π_(S)(9) π_(S)(10) π_(S)(11) π_(S)(12) π_(S)(13) π_(S)(14)π_(S)(15) π_(S)(16) π_(S)(17) 18 2 4 5 17 9 7 1 6 15 8 10 14 16 0 11 1312 3

where π_(s)(j) represents an order of a j-th bit group and N_(info) _(_)_(group) represents a number of the bit groups.
 6. The method of claim5, wherein in the constituting the LDPC information bits, a numberN_(pad) of bit groups in which all bits are to be padded by zero bitsbased on a following equation:${N_{pad} = \left\lfloor \frac{K_{ldpc} - N_{outer}}{360} \right\rfloor},$where K_(ldpc) represents a number of the LDPC information bits,N_(outer) represents a number of the outer-encoded bits.
 7. The methodof claim 6, wherein in the constituting the LDPC information bits, thezero bits are padded to all bit positions of a π_(s)(0)-th bit group, aπ_(s)(1)-th bit group, . . . , a π_(s)(N_(pad)−1)-th bit group among thebit groups based on the pattern.
 8. The method of claim 7, wherein inthe constituting the LDPC information bits, zero bits are additionallypadded to K_(ldpc)−N_(outer)−360×N_(pad) bits from a first bit of aπ_(s)(N_(pad))-th bit group.